1963 search results - page 99 / 393 » The Maximum Solution Problem on Graphs |
125
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
121
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
111
click to vote
IEAAIE
2001
Springer
15 years 7 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— The design of root-Nyquist pulses with the maximum possible energy concentration of the power spectrum is a fundamental problem is communications engineering. Since the...
113
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...