On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Characterizations of totally balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two strikes against perfect phylogeny / rank
 
Normal rank
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: The homogeneous set sandwich problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which claw-free graphs are perfectly orderable? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decision and optimization (\(k\),\(l\))-graph sandwich problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph sandwich problem for 1-join composition is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix sandwich problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sandwich Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and algorithms for graph and hypergraph sandwich problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly triangulated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally-Balanced and Greedy Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded degree interval sandwich problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly Lexical Orderings of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of recognizing perfectly orderable graphs / 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: Chordal bipartite completion of colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank

Latest revision as of 14:40, 26 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
scientific article

    Statements

    On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    3 September 2007
    0 references
    0 references
    graph
    0 references
    sandwich problem
    0 references
    chordal
    0 references
    strongly chordal
    0 references
    0 references