328 search results - page 22 / 66 » Algorithms for the edge-width of an embedded graph |
GD
2006
Springer
15 years 3 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
113
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
89
Voted
COMPGEOM
2009
ACM
15 years 6 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
SIAMCOMP
2008
14 years 11 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
139
click to vote
DLIB
2002
14 years 11 months ago
2002
In this article we present a method for retrieving documents from a digital library through a visual interface based on automatically generated concepts. We used a vocabulary gene...