Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families (Q1186787): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q1179733 / rank
Normal rank
 
Property / author
 
Property / author: Craig A. Tovey / rank
Normal rank
 
Property / author
 
Property / author: Richard B. Borie / rank
 
Normal rank
Property / author
 
Property / author: Craig A. Tovey / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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: Q3812222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3042417 / 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: Q3796771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Bandwidth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: On the complexity of some two-person perfect-information games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial and logical approach to linear-time computability (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subgraph isomorphism problem for outerplanar graphs / 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: Q3740231 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:12, 15 May 2024

scientific article
Language Label Description Also known as
English
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
scientific article

    Statements

    Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    linear-time algorithms
    0 references
    recursive graph class
    0 references
    automatic algorithm generation
    0 references
    predicate calculus
    0 references
    decomposition tree
    0 references

    Identifiers

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