5889 search results - page 372 / 1178 » Graph Layout Problems |
145
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
We introduce a stricter Web community definition to overcome boundary ambiguity of a Web community defined by Flake, Lawrence and Giles [2], and consider the problem of finding co...
168
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...
172
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...
181
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...
142
click to vote
CCCG
2007
15 years 8 months ago
2007
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a t...