1163 search results - page 99 / 233 » Embedding into Bipartite Graphs |
141
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
152
Voted
IEICET
2011
14 years 11 months ago
2011
In a rooted graph, a vertex is designated as its root. An outerplanar graph is represented by a plane embedding such that all vertices appear along its outer boundary. Two differ...
227
click to vote
ICDE
2005
IEEE
16 years 5 months ago
2005
IEEE
In this demonstration, we present a database over complex documents, which, in addition to a structured text content, also has update information, annotations, and embedded object...
134
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
162
click to vote
CCCG
2009
15 years 5 months ago
2009
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...