Computing the branchwidth of interval graphs
نویسندگان
چکیده
منابع مشابه
Branchwidth of chordal graphs
This paper revisits the ’branchwidth territories’ of Kloks, Kratochv́ıl and Müller [12] to provide a simpler proof and a faster algorithm for computing branchwidth of an interval graph. We also generalize the algorithm to the class of chordal graphs, albeit at the expense of exponential running time. Compliance with the ternary constraint of the branchwidth definition is facilitated by a simple ...
متن کاملEdge-maximal graphs of branchwidth k
In this extended abstract we state some definitions and results from our earlier paper [2] and use these to characterize the class of edge-maximal graphs of branchwidth k. Similarly to the maximal graphs of treewidth k (the k-trees) they turn out to be a subclass of chordal graphs where every minimal separator has size k.
متن کاملGeneration of Graphs with Bounded Branchwidth
Branchwidth is a connectivity parameter of graphs closely related to treewidth. Graphs of treewidth at most k can be generated algorithmically as the subgraphs of k-trees. In this paper, we investigate the family of edge-maximal graphs of branchwidth k, that we call k-branches. The k-branches are, just as the k-trees, a subclass of the chordal graphs where all minimal separators have size k. Ho...
متن کاملAlgorithmic generation of graphs of branchwidth
Branchwidth is a connectivity parameter of graphs closely related to treewidth. Graphs of treewidth at most k can be generated algorithmically as the subgraphs of k-trees: starting with Kk+1 one repeatedly chooses a k-clique C and adds a new vertex adjacent to vertices in C. In this paper we give an analogous algorithm for generating the graphs of branchwidth at most k. To this end we first inv...
متن کاملCOMPUTING THE EIGENVALUES OF CAYLEY GRAPHS OF ORDER p2q
A graph is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of $Gamma$. In this paper, we classify all connected tetravalent normal symmetric Cayley graphs of order $p^2q$ where $p>q$ are prime numbers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2005
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.01.015