Minimal comparability completions of arbitrary graphs (Q2476257): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2007.08.039 / 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.dam.2007.08.039 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2123268636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A vertex incremental approach for maintaining chordality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orienting graphs to optimize reachability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Split Completions of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal fill in O(\(n^{2.69}\)) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classification of some edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Proper Interval Completions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898496 / 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 Comparability and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Interval Completion Through Graph Exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2007.08.039 / rank
 
Normal rank

Latest revision as of 21:19, 18 December 2024

scientific article
Language Label Description Also known as
English
Minimal comparability completions of arbitrary graphs
scientific article

    Statements

    Identifiers