5473 search results - page 161 / 1095 » On the graph isomorphism problem |
170
Voted
INFORMS
2008
15 years 7 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
184
Voted
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
182
Voted
ISCAS
2003
IEEE
16 years 9 days ago
2003
IEEE
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
168
Voted
ADHOCNOW
2003
Springer
16 years 8 days ago
2003
Springer
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...
174
Voted
ICCSA
2010
Springer
15 years 9 months ago
2010
Springer
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...