Safe separators for treewidth (Q819825): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59567815 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CALMA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066867008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Radio Link Frequency Assignment: The Calma Project / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and Recognition of Partial 3-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical algorithm for making filled graphs minimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe separators for treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order evaluations on tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dividing a Graph into Triconnected Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for graph four-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving partial constraint satisfaction problems with tree decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / 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
Safe separators for treewidth
scientific article

    Statements

    Safe separators for treewidth (English)
    0 references
    0 references
    0 references
    29 March 2006
    0 references
    0 references
    graph algorithms
    0 references
    preprocessing
    0 references
    0 references
    0 references