Sciweavers

2294 search results - page 333 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
MONET
2006
97views more  MONET 2006»
13 years 9 months ago
Pre-Reply Probe and Route Request Tail: Approaches for Calculation of Intra-Flow Contention in Multihop Wireless Networks
Several applications have been envisioned for multihop wireless networks that require different qualities of service from the network. In order to support such applications, the n...
Kimaya Sanzgiri, Ian D. Chakeres, Elizabeth M. Bel...
JSAC
2010
153views more  JSAC 2010»
13 years 4 months ago
Autonomic traffic engineering for network robustness
Abstract--The continuously increasing complexity of communication networks and the increasing diversity and unpredictability of traffic demand has led to a consensus view that the ...
Ali Tizghadam, Alberto Leon-Garcia
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
14 years 10 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
14 years 6 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
CIKM
2007
Springer
14 years 3 months ago
RDF data exploration and visualization
We present Paged Graph Visualization (PGV), a new semiautonomous tool for RDF data exploration and visualization. PGV consists of two main components: a) the “PGV explorer” an...
Leonidas Deligiannidis, Krys Kochut, Amit P. Sheth