On some optimization problems on \(k\)-trees and partial \(k\)-trees (Q1315461): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q126772600, #quickstatements; #temporary_batch_1721913393134
 
(2 intermediate revisions by 2 users not shown)
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: 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: Q4734761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks immune to isolated failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning trees: Matching, domination, and maximum diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the center and diameter of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks immune to isolated line failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms finding tree-decompositions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The most reliable series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating subgraphs in k-trees: Cables and caterpillars / 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: Steiner trees, partial 2–trees, and minimum IFI networks / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126772600 / rank
 
Normal rank

Latest revision as of 14:26, 25 July 2024

scientific article
Language Label Description Also known as
English
On some optimization problems on \(k\)-trees and partial \(k\)-trees
scientific article

    Statements

    On some optimization problems on \(k\)-trees and partial \(k\)-trees (English)
    0 references
    0 references
    0 references
    10 March 1994
    0 references
    \(k\)-tree
    0 references
    \(k\)-complete graph
    0 references
    path distance optimization
    0 references

    Identifiers

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