Sciweavers

1199 search results - page 41 / 240
» Graph Theory
Sort
View
138
Voted
COMPGEOM
2006
ACM
15 years 8 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
109
Voted
WWW
2008
ACM
16 years 3 months ago
Measuring extremal dependencies in web graphs
We analyze dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical inference for multivariate regular variation. ...
Yana Volkovich, Nelly Litvak, Bert Zwart
EJC
2010
15 years 2 months ago
Geometric properties of Assur graphs
In our previous paper, we presented the combinatorial theory for minimal isostatic pinned frameworks - Assur graphs - which arise in the analysis of mechanical linkages. In this p...
Brigitte Servatius, Offer Shai, Walter Whiteley
111
Voted
CIMCA
2005
IEEE
15 years 8 months ago
Potentials and Limits of Graph-Algorithms for Discovering Ontology Patterns
The aim of the research presented in this paper is to contribute to reduction of development time for ontologies by discovering reusable parts and patterns. The approach is to use...
Christer Thörn, Orjan Eriksson, Eva Blomqvist...
SIAMCOMP
2002
95views more  SIAMCOMP 2002»
15 years 2 months ago
A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph
Given an edge-weighted graph where all weights are nonnegative reals, an edge reweighting is an assignment of nonnegative reals to edges such that, for each vertex, the sums of giv...
Francesco M. Malvestuto, Mauro Mezzini