Diameter determination on restricted graph families (Q5951960): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) / 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: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232788 / 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: Asteroidal Triple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in distance-hereditary 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: LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / 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: A recognition algorithm for the intersection graphs of directed paths in directed trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified all-pairs shortest path algorithms in the chordal hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the semi-perfect elimination / 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: A simple linear-time algorithm for computing the center of an interval graph / 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: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(00)00281-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091612923 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:24, 30 July 2024

scientific article; zbMATH DE number 1687486
Language Label Description Also known as
English
Diameter determination on restricted graph families
scientific article; zbMATH DE number 1687486

    Statements

    Diameter determination on restricted graph families (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 August 2002
    0 references
    0 references
    diameter
    0 references
    chordal graphs
    0 references
    AT-free graphs
    0 references
    eccentricity
    0 references
    LexBFS algorithm
    0 references
    0 references
    0 references
    0 references
    0 references