![[1708.08723] Beyond Outerplanarity](/static/img/curated/desks/afbytes-tech.png)
[1708.08723] Beyond Outerplanarity
Abstract page for arXiv paper 1708.08723: Beyond Outerplanarity
America Forever Bytes
graphs · AFBytes
Other
graphs
Recent coverage
[2606.02472] Correlated uniform attachment trees
Abstract page for arXiv paper 2606.02472: Correlated uniform attachment trees
[2606.01632] A Framework for Graph-Conditioned Hierarchical Shapley Attribution in Patent Valuation
Abstract page for arXiv paper 2606.01632: A Framework for Graph-Conditioned Hierarchical Shapley Attribution in Patent Valuation
YouTube Premium vs. YouTube Premium Lite: What’s the difference?
If you don’t want to splurge on full-blown YouTube Premium, the Lite plan offers an attractive alternative—as long as you know about a few catches.
[2505.20840] Aggregation Buffer: Revisiting DropEdge with a New Parameter Block
Abstract page for arXiv paper 2505.20840: Aggregation Buffer: Revisiting DropEdge with a New Parameter Block
[2506.01467] Feature-Aware (Hyper)graph Generation via Next-Scale Prediction
Abstract page for arXiv paper 2506.01467: Feature-Aware (Hyper)graph Generation via Next-Scale Prediction
[2605.30655] Distance-k Domination Number in Triangular Matchstick Graphs
Abstract page for arXiv paper 2605.30655: Distance-k Domination Number in Triangular Matchstick Graphs
[2404.07093] Rank conditions and amenability for rings associated to graphs
Abstract page for arXiv paper 2404.07093: Rank conditions and amenability for rings associated to graphs
[2605.31010] MoG: Mixture of Experts for Graph-based Retrieval-Augmented Generation
Abstract page for arXiv paper 2605.31010: MoG: Mixture of Experts for Graph-based Retrieval-Augmented Generation
[2605.31016] An Efficient and Scalable Graph Condensation with Structure-Preserving
Abstract page for arXiv paper 2605.31016: An Efficient and Scalable Graph Condensation with Structure-Preserving
Implementing two Graph traversal algorithms in Python: Depth First Search and Breadth First Search
Depth First Search and Breadth First Search I am right in front of a ton of exams and I need to learn about algorithms and data structures. When I read about ps...
[2605.29161] Evolutionary Refinement of Generative Graph Topologies: A Hybrid WGAN-GA Approach
Abstract page for arXiv paper 2605.29161: Evolutionary Refinement of Generative Graph Topologies: A Hybrid WGAN-GA Approach
[2605.29453] Forget Less, Generalize More: Unifying Temporal and Structural Adaptation for Dynamic Graphs
Abstract page for arXiv paper 2605.29453: Forget Less, Generalize More: Unifying Temporal and Structural Adaptation for Dynamic Graphs
[2605.27719] Constructing Block Designs from Complete Graphs
Abstract page for arXiv paper 2605.27719: Constructing Block Designs from Complete Graphs
[2605.28050] Hadwiger's Conjecture for $\{\text{co-claw}, \text{co-gem}\}$-free graphs and $\{\text{fork}, \text{antifork}\}$-free graphs
Abstract page for arXiv paper 2605.28050: Hadwiger's Conjecture for $\{\text{co-claw}, \text{co-gem}\}$-free graphs and $\{\text{fork}, \text{antifork}\}$-free ...
[2605.28082] Two-disjoint-cycle-cover vertex pancyclicity of split-star networks
Abstract page for arXiv paper 2605.28082: Two-disjoint-cycle-cover vertex pancyclicity of split-star networks
[2605.28659] Applications of temporal graph learning for predicting the dynamics of biological systems
Abstract page for arXiv paper 2605.28659: Applications of temporal graph learning for predicting the dynamics of biological systems