Sciweavers

1163 search results - page 2 / 233
» Embedding into Bipartite Graphs
Sort
View
ARSCOM
2007
115views more  ARSCOM 2007»
13 years 5 months ago
Minimal Universal Bipartite Graphs
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...
Vadim V. Lozin, Gábor Rudolf
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
13 years 7 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
JCT
2002
93views more  JCT 2002»
13 years 5 months ago
Coloring Locally Bipartite Graphs on Surfaces
It is proved that there is a function f : N N such that the following holds. Let G be a graph embedded in a surface of Euler genus g with all faces of even size and with edge-wid...
Bojan Mohar, Paul D. Seymour
IJCNN
2007
IEEE
13 years 11 months ago
3D-SE Viewer: A Text Mining Tool based on Bipartite Graph Visualization
—A new interactive visualization tool is proposed for textual data mining based on bipartite graph visualization. Applications to three text datasets are presented to show the ca...
Shiro Usui, Antoine Naud, Naonori Ueda, Tatsuki Ta...
IV
2010
IEEE
193views Visualization» more  IV 2010»
13 years 3 months ago
Drawing Clustered Bipartite Graphs in Multi-circular Style
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...
Takao Ito, Kazuo Misue, Jiro Tanaka