Characterization and Recognition of Partial 3-Trees
From MaRDI portal
Recommendations
- A characterization of partial 3-trees
- Characterization of partial 3-trees in terms of three structures
- scientific article; zbMATH DE number 4008410
- NC Algorithms for Recognizing Partial 2-Trees and 3-Trees
- 3-reconstructibility of rooted trees
- A note on partial 3-trees and homomorphism bases of graphs
- 3-trees in polyhedral maps
- Canonical representations of partial 2-and 3-trees
- Canonical representations of partial 2- and 3-trees
- Forbidden minors characterization of partial 3-trees
Cites work
- Algorithmic Aspects of Vertex Elimination on Graphs
- scientific article; zbMATH DE number 3866594 (Why is no real title available?)
- Networks immune to isolated failures
- Networks immune to isolated line failures
- On simple characterizations of k-trees
- Properties and characterizations of k ‐trees
- Steiner trees, partial 2–trees, and minimum IFI networks
- Topology of series-parallel networks
- Triangulated graphs and the elimination process
Cited in
(62)- Computational properties of argument systems satisfying graph-theoretic constraints
- Characterization of partial 3-trees in terms of three structures
- Steiner problem in Halin networks
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Canonical representations of partial 2- and 3-trees
- An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree
- Complexity of path-forming games
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs
- A partial k-arboretum of graphs with bounded treewidth
- On some optimization problems on \(k\)-trees and partial \(k\)-trees
- Improved self-reduction algorithms for graphs with bounded treewidth
- The nonexistence of reduction rules giving an embedding into a \(k\)-tree
- Regularity and locality in \(k\)-terminal graphs
- Tree-width, clique-minors, and eigenvalues.
- Surfaces, tree-width, clique-minors, and partitions
- Generating internally four-connected graphs
- Reduction algorithms for graphs of small treewidth
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
- Recognizing \(P_ 3\)-structure: A switching approach
- An improved planar graph product structure theorem
- The tree-width of C
- Characterizing graphs of small carving-width
- Tree decomposition and discrete optimization problems: a survey
- Characterizations of H-graphs
- A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata
- Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems
- Fixed-parameter tractability of treewidth and pathwidth
- A characterization of partial 3-trees
- Complexity of Finding Embeddings in a k-Tree
- scientific article; zbMATH DE number 4008410 (Why is no real title available?)
- scientific article; zbMATH DE number 4104996 (Why is no real title available?)
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- scientific article; zbMATH DE number 140151 (Why is no real title available?)
- Graph decompositions and tree automata in reasoning with uncertainty
- Constructive linear time algorithms for branchwidth
- A practical algorithm for the uniform membership problem of labeled multidigraphs of tree-width 2 for spanning tree automata
- A polynomial time algorithm recognizing link trees
- Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results
- Treewidth-two graphs as a free algebra
- Seeing Arboretum for the (partial k-) Trees
- Canonical representations of partial 2-and 3-trees
- Practical algorithms on partial k-trees with an application to domination-like problems
- Heuristic and metaheuristic methods for computing graph treewidth
- Treewidth computations. II. Lower bounds
- Minimum size tree-decompositions
- Minimum size tree-decompositions
- Recognizing hyperelliptic graphs in polynomial time
- A sufficiently fast algorithm for finding close to optimal clique trees
- Using a hybrid of exact and genetic algorithms to design survivable networks
- Characterization and complexity of uniformly nonprimitive labeled 2-structures
- Monadic second-order evaluations on tree-decomposable graphs
- Efficient sets in partial k-trees
- A finite presentation of graphs of treewidth at most three
- Treewidth is NP-complete on cubic graphs
- Treewidth is NP-complete on cubic graphs
- Safe separators for treewidth
- Structure and linear time recognition of 3-leaf powers
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
- Forbidden minors characterization of partial 3-trees
- On two dual classes of planar graphs
- Efficient frequent connected subgraph mining in graphs of bounded tree-width
This page was built for publication: Characterization and Recognition of Partial 3-Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3728922)
