Sciweavers

1163 search results - page 17 / 233
» Embedding into Bipartite Graphs
Sort
View
JPDC
1998
54views more  JPDC 1998»
13 years 7 months ago
Lower Bounds for Dynamic Tree Embedding in Bipartite Networks
Keqin Li, Yi Pan, Hong Shen, Gilbert H. Young, Si-...
KES
2008
Springer
13 years 7 months ago
Readable Representations for Large-Scale Bipartite Graphs
Bipartite graphs appear in various scenes in the real world, and visualizing these graphs helps improve our understanding of network structures. The amount of information that is a...
Shuji Sato, Kazuo Misue, Jiro Tanaka
SIAMDM
2010
166views more  SIAMDM 2010»
13 years 6 months ago
Direct Product Factorization of Bipartite Graphs with Bipartition-reversing Involutions
Given a connected bipartite graph G, we describe a procedure which enumerates and computes all graphs H (if any) for which there is a direct product factorization G ∼= H × K2. W...
Ghidewon Abay-Asmerom, Richard Hammack, Craig E. L...
SEMWEB
2004
Springer
14 years 1 months ago
Bipartite Graphs as Intermediate Model for RDF
Abstract. RDF Graphs are sets of assertions in the form of subjectpredicate-object triples of information resources. Although for simple examples they can be understood intuitively...
Jonathan Hayes, Claudio Gutiérrez
ESA
2004
Springer
132views Algorithms» more  ESA 2004»
14 years 1 months ago
Seeking a Vertex of the Planar Matching Polytope in NC
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
Raghav Kulkarni, Meena Mahajan