Maximal Neighborhood Search and Rigid Interval Graphs
نویسندگان
چکیده
منابع مشابه
Maximal Neighborhood Search and Rigid Interval Graphs
A rigid interval graph is an interval graph which has only one clique tree. In 2009, Panda and Das show that all connected unit interval graphs are rigid interval graphs. Generalizing the two classic graph search algorithms, Lexicographic Breadth-First Search (LBFS) and Maximum Cardinality Search (MCS), Corneil and Krueger propose in 2008 the so-called Maximal Neighborhood Search (MNS) and show...
متن کاملInterval p-Neighborhood Graphs
The (p)-neighborhood graph of a graph G, denoted N p (G), is de-ned on the same vertex set as G, with x; y] 2 E (N 2 (G)) if and only if jN(x)\N(y)j p in G, where N (v) is the open neighborhood of vertex v. The p]-neighborhood graph of G, N p G], is deened similarly, using closed neighborhoods rather than open ones. If G is the underlying graph of a symmetric digraph D, then the p-neighborhood ...
متن کاملEfficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search
In this paper we address the problem of designing O(n) space representations for permutation and interval graphs that provide the neighborhood of any vertex in O(d) time, where d is its degree. To that purpose, we introduce a new parameter, called linearity, that would solve the problem if bounded for the two classes. Surprisingly, we show that it is not. Nevertheless, we design representations...
متن کاملMaximal Common Connected Sets of Interval Graphs
Given a pair of graph G1 = (V,E1), G2 = (V,E2) on the same vertex set, a set S ⊆ V is a maximal common connected set of G1 and G2 if the subgraphs of G1 and G2 induced by S are both connected and S is maximal the inclusion order. The maximal Common Connected sets Problem (CCP for short) consists in identifying the partition of V into maximal common connected sets of G1 and G2. This problem has ...
متن کاملMaximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph T (G) has the triangles of the graph G as its vertices, two of these being adjacent whenever as triangles in G they share an edge. A graph is edge-triangular if every edge is in at least one triangle. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2013
ISSN: 1526-1719
DOI: 10.7155/jgaa.00293