3204 search results - page 203 / 641 » The b-chromatic Number of a Graph |
109
Voted
STOC
2004
ACM
16 years 29 days ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
91
Voted
INFOCOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...
97
Voted
ICRA
1999
IEEE
15 years 5 months ago
1999
IEEE
We consider the robot exploration of a planar graphlike world. The robot's goal is to build a complete map of its environment. The environment is modeled as an arbitrary undi...
133
Voted
COCOON
2005
Springer
15 years 2 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
107
Voted
CCCG
2008
15 years 2 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...