138 search results - page 16 / 28 » Bisimplicial Edges in Bipartite Graphs |
98
Voted
ALGORITHMICA
2010
15 years 2 months ago
2010
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
137
click to vote
COMGEO
2007
ACM
15 years 1 months ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
124
Voted
JGT
2011
14 years 8 months ago
2011
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...
119
Voted
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
118
Voted
SAC
2011
ACM
14 years 4 months ago
2011
ACM
Although the Web lets users freely browse and publish information, most Web information is unauthorized in contrast to conventional mass media. Therefore, it is not always credibl...