123 search results - page 6 / 25 » Simultaneous Geometric Graph Embeddings |
IPMI
2005
Springer
14 years 8 months ago
2005
Springer
This paper presents a general graph-theoretic technique for simultaneously segmenting multiple closed surfaces in volumetric images, which employs a novel graph-construction scheme...
GD
2004
Springer
14 years 22 days ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
DATE
2010
IEEE
14 years 13 days ago
2010
IEEE
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
STOC
1999
ACM
13 years 11 months ago
1999
ACM
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...
CCCG
2008
13 years 8 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...