Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph (Q1985603): 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.tcs.2018.08.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2886539986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large induced degenerate subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating and Generating Labeled <i>k</i>-degenerate Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of monotone dualization: a brief survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing All Maximal Cliques in Large Sparse Real-World Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split Graphs Having Dilworth Number Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum 4-degenerate subgraph of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n / 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: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:28, 22 July 2024

scientific article
Language Label Description Also known as
English
Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph
scientific article

    Statements

    Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 April 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph enumeration
    0 references
    graph algorithms
    0 references
    polynomial delay
    0 references
    degeneracy
    0 references
    chordal graphs
    0 references
    clique trees
    0 references
    0 references