16 search results - page 3 / 4 » Crossing Minimization in Weighted Bipartite Graphs |
PKDD
2009
Springer
13 years 12 months ago
2009
Springer
We propose a new, recursive model to generate realistic graphs, evolving over time. Our model has the following properties: it is (a) flexible, capable of generating the cross pro...
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
FOCS
2009
IEEE
14 years 2 days ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...