Dynamically maintaining split graphs (Q1026107): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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/j.dam.2008.06.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032400288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split-Perfect Graphs: Characterizations and Algorithmic Use / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with no induced \(C_ 4\) and \(2K_ 2\) / 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: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to dynamic all pairs shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splittance of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Split Completions of 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: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Completion Is Fixed Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully dynamic algorithms for chordal graphs and split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Linear-Time Algorithm for Recognizing Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing and Computing Minimal Cograph Completions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear recognition of pseudo-split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split-neighbourhood graphs and the strong perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal Deletion Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining a Planar Graph by Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split 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: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:33, 1 July 2024

scientific article
Language Label Description Also known as
English
Dynamically maintaining split graphs
scientific article

    Statements

    Dynamically maintaining split graphs (English)
    0 references
    0 references
    0 references
    24 June 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    split graphs
    0 references
    dynamic algorithms
    0 references
    on-line algorithms
    0 references
    minimal split completions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references