Sciweavers

1857 search results - page 41 / 372
» Minimum Degree Orderings
Sort
View
SIAMNUM
2011
108views more  SIAMNUM 2011»
13 years 5 months ago
A Mixed Method for the Biharmonic Problem Based On a System of First-Order Equations
We introduce a new mixed method for the biharmonic problem. The method is based on a formulation where the biharmonic problem is re-written as a system of four first-order equatio...
Edwin M. Behrens, Johnny Guzmán
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 4 months ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
ICPP
1995
IEEE
14 years 2 months ago
Multilevel Graph Partitioning Schemes
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
George Karypis, Vipin Kumar
ARSCOM
2007
81views more  ARSCOM 2007»
13 years 11 months ago
Graphic Sequences with a Realization Containing a Friendship Graph
For any simple graph H, let σ(H, n) be the minimum m so that for any realizable degree sequence π = (d1, d2, . . . , dn) with sum of degrees at least m, there exists an n-vertex...
Michael Ferrara, Ronald J. Gould, John R. Schmitt
COMGEO
2010
ACM
13 years 11 months ago
Pointed binary encompassing trees: Simple and optimal
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...