A linear time algorithm to compute a dominating path in an AT-free graph (Q673002): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(95)00021-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003352119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected domination and steiner set on asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of regular subgraph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3797233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapezoid graphs and their coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation Graphs and Transitive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination on Cocomparability Graphs / 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: An optimal greedy heuristic to color interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898496 / rank
 
Normal rank

Latest revision as of 11:22, 27 May 2024

scientific article
Language Label Description Also known as
English
A linear time algorithm to compute a dominating path in an AT-free graph
scientific article

    Statements

    A linear time algorithm to compute a dominating path in an AT-free graph (English)
    0 references
    0 references
    0 references
    0 references
    28 February 1997
    0 references
    0 references
    Asteroidal triple-free graphs
    0 references
    Domination
    0 references
    Algorithms
    0 references
    0 references