1101 search results - page 94 / 221 » An Algorithm for the Graph Crossing Number Problem |
150
click to vote
DAC
2004
ACM
16 years 5 months ago
2004
ACM
Capacitance extraction is an important problem that has been extensively studied. This paper presents a significant improvement for the fast multipole accelerated boundary element...
148
click to vote
IPCO
2010
15 years 6 months ago
2010
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
169
click to vote
APPROX
2011
Springer
14 years 4 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
123
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
131
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...