A story of diameter, radius, and (almost) Helly property (Q6087123): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1002/net.21998 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.21998 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3094137245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3514516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-modular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dismantling absolute retracts of reflexive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Radon theorem for Helly graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique graphs and Helly graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Distance Preservers and Additive Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Into the square: on the complexity of some quadratic-time solvable problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering nearly surface-embedded graphs with a fixed number of balls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Codes in Hereditary Classes of Graphs and VC-Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: VC-dimension and Erdős-Pósa property / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algorithmic use of hypertree structure and maximum neighbourhood orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4635985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dually Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for graphs of bounded treewidth via orthogonal range searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constructible graphs, infinite bridged graphs and weakly cop-win graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a central vertex in an HHD-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation of eccentricities and distances in hyperbolic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and Covering δ-Hyperbolic Spaces by Balls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering planar graphs with a fixed number of balls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter determination on restricted graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of BFS to determine a graph's diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity aspects of the Helly property: graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in quadrangle-free Helly graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(r\)-dominating cliques in graphs with hypertree structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4272121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast diameter computation within split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter computation on <i>H</i>-minor free graphs and graphs of bounded (distance) VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity in Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the center and diameter of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Six theorems about injective metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to recognize squares of split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster recognition of clique-Helly and hereditary clique-Helly graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded VC-dimension implies a fractional Helly theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear-time algorithm for computing the center of an interval graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and fixed-point properties in Helly graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constructible graphs, locally Helly graphs, and convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms for the diameter and radius of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the density of families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Covert Set-Cover Problem with Application to Network Discovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial problem; stability and order for models and theories in infinitary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for optimal 2-constraint satisfaction and its implications / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NET.21998 / rank
 
Normal rank

Latest revision as of 19:19, 30 December 2024

scientific article; zbMATH DE number 7775300
Language Label Description Also known as
English
A story of diameter, radius, and (almost) Helly property
scientific article; zbMATH DE number 7775300

    Statements

    A story of diameter, radius, and (almost) Helly property (English)
    0 references
    0 references
    0 references
    0 references
    11 December 2023
    0 references
    chordal graphs
    0 references
    diameter
    0 references
    eccentricity computations
    0 references
    fine-grained complexity in P
    0 references
    Helly graphs
    0 references
    structural graph theory
    0 references
    algorithmic graph theory
    0 references
    VC-dimension
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers