1986 search results - page 101 / 398 » Path Separability of Graphs |
CATS
2008
13 years 10 months ago
2008
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
OTM
2010
Springer
13 years 6 months ago
2010
Springer
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
COMBINATORICS
2007
13 years 8 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
ESA
1999
Springer
14 years 1 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
—In this paper, we propose new “low-overhead” network monitoring techniques to detect violations of path-level QoS guarantees like end-to-end delay, loss, etc. Unlike existin...