Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2008.07.020 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Every monotone graph property is testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Several results on chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measures on monotone properties of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical algorithm for making filled graphs minimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe separators for treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Minimum Fill-in: Grouping the Minimal Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness results for edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal parallel co-connectivity algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4373676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal chordal subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding a Maximal Planar Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Split Completions of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A completely dynamic algorithm for split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Minimal Interval Completions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for graph search and connectivity determination on complement graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / 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: Complexity classification of some edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and algorithmic applications of chordal graph embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the interval completion of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Proper Interval Completions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5683627 / 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: A fully dynamic algorithm for modular decomposition and recognition of cographs. / 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 / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2008.07.020 / rank
 
Normal rank

Latest revision as of 12:15, 10 December 2024

scientific article
Language Label Description Also known as
English
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
scientific article

    Statements

    Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (English)
    0 references
    0 references
    0 references
    19 February 2009
    0 references
    linear-time algorithms
    0 references
    minimal completions of graphs
    0 references
    minimal deletions of graphs
    0 references
    graph classes
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers