Hybrid backtracking bounded by tree-decomposition of constraint networks (Q814455): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q4252378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficiently fast algorithm for finding close to optimal clique trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal backtrack algorithm for tree-structured constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radio link frequency assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2717783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological parameters for time-space tradeoff / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree clustering for constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sufficient Condition for Backtrack-Free Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386920 / 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: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theoretical evaluation of selected backtracking algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency in networks of relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks of constraints: Fundamental properties and applications to picture processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / 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: Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis / 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

Latest revision as of 10:59, 24 June 2024

scientific article
Language Label Description Also known as
English
Hybrid backtracking bounded by tree-decomposition of constraint networks
scientific article

    Statements

    Hybrid backtracking bounded by tree-decomposition of constraint networks (English)
    0 references
    0 references
    0 references
    7 February 2006
    0 references
    0 references
    Constraint networks
    0 references
    Time-space
    0 references
    Hybrid algorithms
    0 references
    Tree-decomposition
    0 references
    Empirical evaluation
    0 references