6740 search results - page 479 / 1348 » An s -Hamiltonian Line Graph Problem |
203
click to vote
DIALM
2005
ACM
15 years 8 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
193
click to vote
UAI
2003
15 years 8 months ago
2003
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain ...
157
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...
168
click to vote
MST
2010
15 years 5 months ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
209
click to vote
DASFAA
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract. Discovery of evolving regions in large graphs is an important issue because it is the basis of many applications such as spam websites detection in the Web, community lif...