6740 search results - page 385 / 1348 » An s -Hamiltonian Line Graph Problem |
133
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
140
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
137
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
152
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— In this paper, we study the problem of exact emulation of two types of optical queues: (i) N-to-1 output-buffered multiplexers with variable length bursts, and (ii) N ...
112
click to vote
CIBCB
2007
IEEE
15 years 11 months ago
2007
IEEE
—Many dynamical processes can be represented as directed attributed graphs or Petri nets where relationships between various entities are explicitly expressed. Signaling networks...