Finding Good Decompositions for Dynamic Programming on Dense Graphs (Q2891352): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-28050-4_18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W96963885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Boolean-Width of a Graph: Structure and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes with Structured Neighborhoods and Algorithmic Applications / 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: Treewidth: Characterizations, Applications, and Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth computations. I: Upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth computations. II. Lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean-width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of structural CSP decomposition methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Branch-Decompositions and Rank-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local Search Algorithm for Branchwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid ab initio prediction of RNA pseudoknots via graph tree decomposition / rank
 
Normal rank

Latest revision as of 08:03, 5 July 2024

scientific article
Language Label Description Also known as
English
Finding Good Decompositions for Dynamic Programming on Dense Graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references