Sciweavers

785 search results - page 56 / 157
» Embedding a Forest in a Graph
Sort
View
TCS
2008
13 years 9 months ago
Competitive graph searches
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
INFOCOM
2009
IEEE
14 years 3 months ago
An Economically-Principled Generative Model of AS Graph Connectivity
We explore the problem of modeling Internet connectivity at the Autonomous System (AS) level and present an economically-principled dynamic model that reproduces key features of t...
Jacomo Corbo, Shaili Jain, Michael Mitzenmacher, D...
GD
2007
Springer
14 years 3 months ago
Constrained Simultaneous and Near-Simultaneous Embeddings
A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets γ : V1 → V2 is a pair of planar straightline drawi...
Fabrizio Frati, Michael Kaufmann, Stephen G. Kobou...
RTCSA
2005
IEEE
14 years 2 months ago
Deadline Spanning: A Graph Based Approach
Microkernel based systems tend to depend heavily on IPC. This paper adresses the problem of a system response spanning more than one task in an embedded real-time system. The appr...
Stefan M. Petters
ICALP
1992
Springer
14 years 1 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao