Distance Approximation in Bounded-Degree and General Sparse Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/11830924_43
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Sparse Universal Graphs for Bounded-Degree Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2007English

Testing Expansion in Bounded-Degree Graphs

2007English

Degree Distance of Unicyclic Graphs

Filomat
Mathematics
2010English

Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs

SIAM Journal on Computing
MathematicsComputer Science
2009English

On the Number of Connected Sets in Bounded Degree Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Delay Performance of CSMA in Networks With Bounded Degree Conflict Graphs

2011English

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Diameter Computation on H-Minor Free Graphs and Graphs of Bounded (Distance) VC-dimension

2020English

Distant Sum Distinguishing Index of Graphs With Bounded Minimum Degree

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy