Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey / 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: Q3029044 / 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: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph expressions and graph rewritings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computation of optimal subgraphs of decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Dcomposition of Recursive Graph Classes / 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: Equivalences and transformations of regular systems - applications to recursive program schemes and grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum dominating sets with minimum intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperedge replacement: grammars and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4711083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: an ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3924253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms finding tree-decompositions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of finding iso- and other morphisms for partial \(k\)- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiple steiner subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-maximal matching in series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficiently solvable case of the minimum weight equivalent subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Paths—A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3766846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3692864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computability of combinatorial problems on series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, partial 2–trees, and minimum IFI networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3822197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740231 / rank
 
Normal rank

Revision as of 16:37, 23 May 2024

scientific article
Language Label Description Also known as
English
Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
scientific article

    Statements

    Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (English)
    0 references
    0 references
    9 October 1995
    0 references
    tree-decomposable graphs
    0 references
    dynamic programming
    0 references
    polynomial-time algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers