The diameter of AT‐free graphs (Q6057658): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
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: Graphs with Connected Medians / 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: An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of 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: Cop and Robber Game and Hyperbolicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter determination on restricted graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs / 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: Dominating Pair Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost diameter of a house-hole-free graph in linear time via LexBFS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line-distortion, bandwidth and path-length of a graph / 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: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: End-vertices of LBFS of (AT-free) bigraphs / 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: On claw-free asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of graphs with bounded asteroidal number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Between<i>O</i>(<i>nm</i>) and<i>O</i>(<i>n<sup>alpha</sup></i>) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of a finite graph by a set of intervals on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: The leafage of a chordal graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time graph distance and diameter approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slimness of graphs / 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: 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 all-pairs-shortest-path problem in unweighted undirected graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subcubic Equivalences Between Path, Matrix, and Triangle Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for optimal 2-constraint satisfaction and its implications / rank
 
Normal rank

Revision as of 01:55, 3 August 2024

scientific article; zbMATH DE number 7746130
Language Label Description Also known as
English
The diameter of AT‐free graphs
scientific article; zbMATH DE number 7746130

    Statements

    The diameter of AT‐free graphs (English)
    0 references
    0 references
    5 October 2023
    0 references
    AT-free graphs
    0 references
    chordal graphs
    0 references
    dominating pairs
    0 references
    fine-grained complexity in P
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references