20 search results - page 1 / 4 » Bipartite subgraphs of integer weighted graphs |
101
Voted
DM
1998
15 years 24 days ago
1998
For every integer p > 0 let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large...
117
Voted
COCOON
2006
Springer
15 years 3 months ago
2006
Springer
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...
102
Voted
FSTTCS
2007
Springer
15 years 7 months ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
125
Voted
CPC
2010
14 years 10 months ago
2010
A string graph is the intersection graph of a collection of continuous arcs in the plane. It is shown that any string graph with m edges can be separated into two parts of roughly...
126
Voted
WG
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...