215 search results - page 19 / 43 » Approximating Geometrical Graphs via |
CORR
2006
Springer
13 years 10 months ago
2006
Springer
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
WCNC
2010
IEEE
14 years 1 months ago
2010
IEEE
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
GD
2004
Springer
14 years 3 months ago
2004
Springer
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
SODA
2012
ACM
12 years 8 days ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...