Sciweavers

126 search results - page 18 / 26
» A class of hierarchical graphs as topologies for interconnec...
Sort
View
FOCS
1995
IEEE
13 years 11 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
CONEXT
2008
ACM
13 years 9 months ago
On cooperative settlement between content, transit and eyeball internet service providers
Internet service providers (ISPs) depend on one another to provide global network services. However, the profit-seeking nature of the ISPs leads to selfish behaviors that result i...
Richard T. B. Ma, Dah-Ming Chiu, John C. S. Lui, V...
IWOCA
2010
Springer
232views Algorithms» more  IWOCA 2010»
13 years 2 months ago
Computing Role Assignments of Proper Interval Graphs in Polynomial Time
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
Pinar Heggernes, Pim van 't Hof, Daniël Paulu...
PADS
2005
ACM
14 years 28 days ago
Simulating Realistic Packet Routing without Routing Protocols
A fundamental requirement for any network simulation environment is the realistic forwarding of packets from a source to a destination in the simulated topology. The routing decis...
George F. Riley, Dheeraj Reddy
BIBE
2005
IEEE
154views Bioinformatics» more  BIBE 2005»
14 years 1 months ago
Effective Pre-Processing Strategies for Functional Clustering of a Protein-Protein Interactions Network
In this article we present novel preprocessing techniques, based on topological measures of the network, to identify clusters of proteins from Protein-protein interaction (PPI) ne...
Duygu Ucar, Srinivasan Parthasarathy, Sitaram Asur...