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

doi 10.1137/1.9781611975994.117
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Erdős–Hajnal Conjecture for Graphs With Bounded VC-Dimension

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2018English

Distance Approximation in Bounded-Degree and General Sparse Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

A New Family of Distance-Regular Graphs With Unbounded Diameter

Inventiones Mathematicae
Mathematics
2005English

Sparse Universal Graphs for Bounded-Degree Graphs

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

The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs

Journal of Graph Theory
GeometryTopology
2013English

Approximation Schemes via Width/Weight Trade-Offs on Minor-Free Graphs

2020English

A PTAS for Subset TSP in Minor-Free Graphs

2020English

Distance Graphs on the Integers

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2005English

On the Steiner 4-Diameter of Graphs

Journal of Interconnection Networks
Computer NetworksCommunications
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy