1986 search results - page 117 / 398 » Path Separability of Graphs |
111
click to vote
ICNP
2005
IEEE
15 years 8 months ago
2005
IEEE
Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles tha...
149
click to vote
ICFCA
2004
Springer
15 years 8 months ago
2004
Springer
Traditional logic can be understood as the investigation of the three main essential functions of thinking – concepts, judgements and conclusions. In the last years, in a new res...
115
click to vote
KAIS
2007
15 years 3 months ago
2007
Published scientific articles are linked together into a graph, the citation graph, through their citations. This paper explores the notion of similarity based on connectivity alo...
139
click to vote
ALGORITHMICA
2011
14 years 10 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
111
click to vote
PDCAT
2007
Springer
15 years 9 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...