57 search results - page 4 / 12 » Edge cover by bipartite subgraphs |
185
click to vote
CPC
2010
15 years 4 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...
192
click to vote
ISAAC
2007
Springer
16 years 24 days ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
184
click to vote
COLT
2003
Springer
15 years 12 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
187
click to vote
INFOCOM
2007
IEEE
16 years 29 days ago
2007
IEEE
— IEEE 802.11 Wi-Fi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using...
175
click to vote
EJC
1998
15 years 6 months ago
1998
A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes, median graphs, almost median graphs, premedian graphs and partial cubes. Structu...