6740 search results - page 1127 / 1348 » An s -Hamiltonian Line Graph Problem |
181
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— We consider the problem of serving multicast flows in a crossbar switch. We show that linear network coding across packets of a flow can sustain traffic patterns that cannot...
201
click to vote
CIKM
2007
Springer
16 years 1 months ago
2007
Springer
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
218
click to vote
EMMCVPR
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. This paper presents a Bayesian inference algorithm for image layer representation [26], 2.1D sketch [6], with mixed Markov random field. 2.1D sketch is an very important...
195
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
212
click to vote
BIBE
2006
IEEE
16 years 1 months ago
2006
IEEE
Discerning the similarity between two molecules is a challenging problem in drug discovery as well as in molecular biology. The importance of this problem is due to the fact that ...