Computing maximum stable sets for distance-hereditary graphs (Q2568337): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2005.03.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013491634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4855426 / rank
 
Normal rank

Latest revision as of 17:19, 10 June 2024

scientific article
Language Label Description Also known as
English
Computing maximum stable sets for distance-hereditary graphs
scientific article

    Statements

    Computing maximum stable sets for distance-hereditary graphs (English)
    0 references
    10 October 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Distance-hereditary graph
    0 references
    Combinatorial optimization
    0 references
    Greedy scheme
    0 references
    0 references
    0 references
    0 references