Results 11 to 20 of about 102,821 (271)
Completely Independent Spanning Trees in (Partial) k-Trees
Discussiones Mathematicae Graph Theory, 2015 Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint.
Matsushita Masayoshi +2 more
doaj +4 more sources
Transversals of Longest Cycles in Partial $k$-Trees and Chordal Graphs [PDF]
Journal of Graph Theory, 2019 AbstractLet be the minimum cardinality of a set of vertices that intersects every longest cycle of a 2‐connected graph . We show that if is a partial ‐tree and that if is chordal, where is the cardinality of a maximum clique in . Those results imply that all longest cycles intersect in 2‐connected series‐parallel graphs and in 3‐trees.
Juan Gutiérrez
openalex +4 more sources
Efficient sets in partial k-trees
Discrete Applied Mathematics, 1993 The efficiency of a graph is the maximum number of vertices uniquely dominated by a subset of vertices in the graph. In this paper, a linear time algorithm is developed for finding the efficiency of a partial \(k\)- tree given its embedding in a \(k\)-tree.
Jan Arne Telle, Andrzej Proskurowski
openalex +3 more sources
On some problems on k-trees and partial k-trees
, 2010 The objective of this thesis is to investigate some structural and algorithmic properties of k-trees and partial k-trees. A k-tree can be constructed from a k-complete graph by recursively adding a new vertex which is adjacent to all vertices of an existing k-complete subgraph. Partial k-trees are graphs embeddable in a k-tree with the same vertex set.
Darko Skorin‐Kapov
openalex +2 more sources
An NC parallel algorithm for generalized vertex-rankings of partial k-trees
Theoretical Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M.A. Kashem, Xiao Zhou, Takao Nishizeki
openalex +3 more sources
Maximum packing for k-connected partial k-trees in polynomial time
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anders Dessmark +2 more
openalex +3 more sources
The inverse inertia problem for the complements of partial k -trees
Linear Algebra and its Applications, 2013 10 ...
Hein van der Holst
openalex +3 more sources
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics, 1989 We present and illustrate by a sequence of examples an algorithm paradigm for solving NP-hard problems on graphs resticted to partial graphs of k- trees and given with an embedding in a k-tree. Such algorithms, linear in the size of the graph but exponential or superexponential in k, exist for most NP-hard problems that have linear time algorithms for ...
Stefan Arnborg, Andrzej Proskurowski
openalex +3 more sources
Efficient algorithms and partial k-trees
Discrete Applied Mathematics, 1994 openalex +2 more sources