Sciweavers

704 search results - page 46 / 141
» Isometrically Embedded Graphs
Sort
View
COMGEO
2006
ACM
13 years 9 months ago
Compatible triangulations and point partitions by series-triangular graphs
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
Jeff Danciger, Satyan L. Devadoss, Don Sheehy
COMBINATORICS
1999
93views more  COMBINATORICS 1999»
13 years 9 months ago
Induced Complete h-partite Graphs in Dense Clique-less Graphs
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...
Eldar Fischer
WAIM
2010
Springer
13 years 8 months ago
HyperGraphDB: A Generalized Graph Database
We present HyperGraphDB, a novel graph database based on generalized hypergraphs where hyperedges can contain other hyperedges. This generalization automatically reifies every ent...
Borislav Iordanov
WORDS
2005
IEEE
14 years 3 months ago
A Graph-Based Model for Component-Based Software Development
Software metrics can be used to objectively quantify the quality of software components and systems, alleviating quality and risk concerns and raising assurance in component-based...
Sahra Sedigh-Ali, Arif Ghafoor
COMPGEOM
2011
ACM
13 years 1 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...