2796 search results - page 138 / 560 » The coolest path problem |
167
click to vote
ICDCS
2009
IEEE
15 years 2 months ago
2009
IEEE
In recent years, there are substantial demands to reduce packet loss in the Internet. Among the schemes proposed, finding backup paths in advance is considered to be an effective ...
138
click to vote
WALCOM
2010
IEEE
16 years 22 hour ago
2010
IEEE
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number i...
119
Voted
AUTOMATICA
2006
15 years 5 months ago
2006
: A path-following problem for linear systems with unstable zero dynamics is solved. While the original control variable steers the system output along the path, the path parameter...
137
Voted
COCOON
2006
Springer
15 years 8 months ago
2006
Springer
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
139
click to vote
AAIM
2008
Springer
15 years 6 months ago
2008
Springer
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...