A linear time algorithm to list the minimal separators of chordal graphs (Q819826): 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.disc.2005.12.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030330259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating and characterizing the perfect elimination orderings of a chordal graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Listing Combinatorial Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all minimum-size separating vertex sets in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Pathwidth of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing all Minimal Separators of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal vertex separators of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477966 / 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: Efficient enumeration of all minimal separators in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some aspects of perfect elimination orderings in chordal 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: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:40, 24 June 2024

scientific article
Language Label Description Also known as
English
A linear time algorithm to list the minimal separators of chordal graphs
scientific article

    Statements

    A linear time algorithm to list the minimal separators of chordal graphs (English)
    0 references
    0 references
    0 references
    29 March 2006
    0 references
    0 references
    perfect elimination ordering
    0 references
    0 references