6740 search results - page 347 / 1348 » An s -Hamiltonian Line Graph Problem |
137
click to vote
EOR
2008
15 years 4 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
132
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
115
click to vote
JSAC
2008
15 years 4 months ago
2008
Abstract--In this paper, a vector-form factor graph representation is derived for intersymbol interference (ISI) channels. The resultant graphs have a tree-structure that avoids th...
141
Voted
ISCI
2007
15 years 4 months ago
2007
Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, p...
165
click to vote
OL
2010
14 years 11 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...