Minimal interval completion through graph exploration (Q1001896): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2008.09.053 / rank
Normal rank
 
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/j.tcs.2008.09.053 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982692675 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62046056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separability generalizes Dirac's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth: Structure and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the pathwidth of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT / 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: Minimal Split Completions of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal comparability completions of arbitrary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal augmentation of a graph to obtain an interval graph / 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: Minimal Proper Interval Completions / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2008.09.053 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:15, 10 December 2024

scientific article
Language Label Description Also known as
English
Minimal interval completion through graph exploration
scientific article

    Statements

    Minimal interval completion through graph exploration (English)
    0 references
    0 references
    0 references
    19 February 2009
    0 references
    interval graph
    0 references
    minimal interval completion
    0 references

    Identifiers