Amanote Research
Register
Sign In
Sparse Universal Graphs for Bounded-Degree Graphs
Random Structures and Algorithms
- United States
doi 10.1002/rsa.20143
Full Text
Open PDF
Abstract
Available in
full text
Categories
Mathematics
Applied Mathematics
Computer Graphics
Computer-Aided Design
Software
Date
January 1, 2007
Authors
Noga Alon
Michael Capalbo
Publisher
Wiley
Related search
Distance Approximation in Bounded-Degree and General Sparse Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Testing Expansion in Bounded-Degree Graphs
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
SIAM Journal on Computing
Mathematics
Computer Science
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Distant Sum Distinguishing Index of Graphs With Bounded Minimum Degree
Ars Mathematica Contemporanea
Algebra
Combinatorics
Number Theory
Geometry
Discrete Mathematics
Theoretical Computer Science
Topology
On the Number of Connected Sets in Bounded Degree Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Delay Performance of CSMA in Networks With Bounded Degree Conflict Graphs
Universal H-Colourable Graphs
Graphs and Combinatorics
Combinatorics
Theoretical Computer Science
Discrete Mathematics
Universal Traversal Sequences for Expander Graphs
Information Processing Letters
Signal Processing
Computer Science Applications
Information Systems
Theoretical Computer Science
