Graph modification problem for some classes of graphs (Q350726): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Classes of bipartite graphs related to chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / 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: On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly chordal and chordal bipartite graphs are sandwich monotone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions / 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: Chordal bipartite completion of colored graphs / 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

Latest revision as of 03:27, 13 July 2024

scientific article
Language Label Description Also known as
English
Graph modification problem for some classes of graphs
scientific article

    Statements

    Identifiers