721 search results - page 11 / 145 » Graphs with Large Obstacle Numbers |
WECWIS
2007
IEEE
15 years 6 months ago
2007
IEEE
With the growing number and ubiquitous usage of Web services throughout the service-oriented community, the need to find service descriptions in a given repository, as well as co...
CIE
2007
Springer
15 years 5 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
95
Voted
SIAMDM
2000
14 years 11 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
105
Voted
GD
1998
Springer
15 years 3 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
97
Voted
SODA
2007
ACM
15 years 1 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...