6740 search results - page 423 / 1348 » An s -Hamiltonian Line Graph Problem |
167
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
171
click to vote
AAIM
2009
Springer
16 years 1 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
179
click to vote
IROS
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— In this paper, we present an optimization framework for target tracking with mobile robot teams. The target tracking problem is modeled as a generic semidefinite progr...
201
click to vote
ENTCS
2007
15 years 6 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
193
click to vote
SIAMDM
1998
15 years 6 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...