677 search results - page 1 / 136 » Bipartite roots of graphs |
SODA
2004
ACM
14 years 16 days ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
TCS
2010
13 years 5 months ago
2010
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
IPL
2007
13 years 11 months ago
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
ARSCOM
2007
13 years 11 months ago
2007
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
IV
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract—Bipartite graphs are often used to illustrate relationships between two sets of data, such as web pages and visitors. At the same time, information is often organized hi...