754 search results - page 138 / 151 » Exact Algorithms for the Vertex Separator Problem in Graphs |
127
Voted
BROADNETS
2005
IEEE
15 years 9 months ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
103
Voted
AGILE
2009
Springer
15 years 10 months ago
2009
Springer
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...
134
Voted
SMI
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract In this paper, we study the problem of approximate topological matching for quadrilateral meshes, that is, the problem of finding as large a set as possible of matching p...
158
Voted
SODA
2010
ACM
15 years 2 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
124
click to vote
GD
2005
Springer
15 years 9 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...