Maximal chordal subgraphs
نویسندگان
چکیده
منابع مشابه
A new augmentation based algorithm for extracting maximal chordal subgraphs
A graph is chordal if every cycle of length greater than three contains an edge between non-adjacent vertices. Chordal graphs are of interest both theoretically, since they admit polynomial time solutions to a range of NP-hard graph problems, and practically, since they arise in many applications including sparse linear algebra, computer vision, and computational biology. A maximal chordal subg...
متن کاملThe size of chordal, interval and threshold subgraphs
Let G* be the class of graphs with n vertices and m edges, and H* a class of graphs. Then there is a number f such that every member of G’ contains a member of H* with at least f edges, and there is a member of G” containing no member of H* with more than f edges. In practice jc may be hard to find and we bound it by finding a lower bound fi (there must be a member of H* with at least fi edges)...
متن کاملThe Existence of Homeomorphic Subgraphs in Chordal Graphs
We establish conditions for the existence, in a chordal graph, of subgraphs homeomorphic to Kn (n ≥ 3), Km,n (m,n ≥ 2), and wheels Wr (r ≥ 3). Using these results, we develop a simple linear time algorithm for testing planarity of chordal graphs. We also show how these results lead to simple polynomial time algorithms for the Fixed Subgraph Homeomorphism problem on chordal graphs for some speci...
متن کاملApproximating maximum weight K-colorable subgraphs in chordal graphs
We present a 2-approximation algorithm for the problem of finding the maximum weight K-colorable subgraph in a given chordal graph with node weights. The running time of the algorithm is O(K(n+m)), where n and m are the number of vertices and edges in the given graph.
متن کاملMaximal proper subgraphs of median graphs
For a median graph G and a vertex v of G that is not a cut-vertex we show that G − v is a median graph precisely when v is not the center of a bipartite wheel, which is in turn equivalent with the existence of a certain edge elimination scheme for edges incident with v. This implies a characterization of vertex-critical (respectively, vertex-complete) median graphs, which are median graphs whos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1988
ISSN: 0166-218X
DOI: 10.1016/0166-218x(88)90075-3