Characterization and Recognition of Partial 3-Trees (Q3728922): 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.1137/0607033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038674294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3334090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties and characterizations of <i>k</i> ‐trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks immune to isolated failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks immune to isolated line failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulated graphs and the elimination process / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple characterizations of k-trees / 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: Steiner trees, partial 2–trees, and minimum IFI networks / rank
 
Normal rank

Latest revision as of 15:10, 17 June 2024

scientific article
Language Label Description Also known as
English
Characterization and Recognition of Partial 3-Trees
scientific article

    Statements

    Characterization and Recognition of Partial 3-Trees (English)
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph reduction
    0 references
    confluent reduction
    0 references
    k-tree
    0 references
    polynomial time algorithm
    0 references
    recognizing subgraphs
    0 references
    3-trees
    0 references
    reliability of communication networks
    0 references
    complexity of queries in data base systems
    0 references
    0 references