1327 search results - page 132 / 266 » Path following algorithm for the graph matching problem |
132
click to vote
DAM
2010
15 years 4 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
112
click to vote
DEXA
2003
Springer
15 years 9 months ago
2003
Springer
This paper presents an algorithm for termination static analysis of active rules with priorities. Active rules termination is an undecidable problem. Several recent works have sugg...
155
click to vote
SPAA
1993
ACM
15 years 8 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
166
click to vote
SPAA
1999
ACM
15 years 8 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
164
click to vote
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...