Sciweavers

63 search results - page 8 / 13
» Graph Voronoi Regions for Interfacing Planar Graphs
Sort
View
PC
2000
100views Management» more  PC 2000»
14 years 9 months ago
Parallel optimisation algorithms for multilevel mesh partitioning
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the...
Chris Walshaw, Mark Cross
76
Voted
COMBINATORICS
1998
89views more  COMBINATORICS 1998»
14 years 9 months ago
Venn Diagrams with Few Vertices
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
Bette Bultena, Frank Ruskey
71
Voted
ICC
2007
IEEE
145views Communications» more  ICC 2007»
15 years 4 months ago
Enhancements to Cognitive Radio Based IEEE 802.22 Air-Interface
—The IEEE 802.22 standard for wireless regional area network is the first standard for cognitive radio that tries to harness the idle or under-utilized spectrum allocated for TV...
Shamik Sengupta, Swastik Brahma, Mainak Chatterjee...
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
14 years 9 months ago
Kasteleyn Cokernels
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
Greg Kuperberg
SODA
2007
ACM
123views Algorithms» more  SODA 2007»
14 years 11 months ago
Region-fault tolerant geometric spanners
We introduce the concept of region-fault tolerant spanners for planar point sets, and prove the existence of region-fault tolerant spanners of small size. For a geometric graph G ...
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, ...