Sciweavers

677 search results - page 46 / 136
» Bipartite roots of graphs
Sort
View
93
Voted
ALGORITHMICA
2010
108views more  ALGORITHMICA 2010»
15 years 20 days ago
An Efficient Algorithm for Batch Stability Testing
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...
John Dabney, Brian C. Dean
127
Voted
COMGEO
2007
ACM
15 years 16 days ago
Graph drawings with few slopes
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...
Vida Dujmovic, Matthew Suderman, David R. Wood
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
15 years 9 days ago
On Bipartite Drawings and the Linear Arrangement Problem
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
Farhad Shahrokhi, Ondrej Sýkora, Lás...
114
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
Online Bipartite Perfect Matching With Augmentations
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
Kamalika Chaudhuri, Constantinos Daskalakis, Rober...
97
Voted
RSA
2010
108views more  RSA 2010»
14 years 11 months ago
Resolvent of large random graphs
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
Charles Bordenave, Marc Lelarge