Sciweavers

347 search results - page 19 / 70
» Schaefer's theorem for graphs
Sort
View
GG
2008
Springer
14 years 10 months ago
Resolution-Like Theorem Proving for High-Level Conditions
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...
Karl-Heinz Pennemann
RSA
2010
64views more  RSA 2010»
14 years 7 months ago
Vertices of given degree in series-parallel graphs
We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size n satisfy a central limit theorem with mean and variance proport...
Michael Drmota, Omer Giménez, Marc Noy
EJC
2007
14 years 9 months ago
An integrality theorem of root systems
Let Φ be an irreducible root system and ∆ be a base for Φ; it is well known that any root in Φ is an integral combination of the roots in ∆. In comparison to this fact, we ...
A. Bhattacharya, G. R. Vijayakumar
CORR
2010
Springer
91views Education» more  CORR 2010»
14 years 9 months ago
Ultrametric watersheds: a bijection theorem for hierarchical edge-segmentation
Abstract. We study hierachical segmentation in the framework of edgeweighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that th...
Laurent Najman
CIAC
2010
Springer
278views Algorithms» more  CIAC 2010»
15 years 2 months ago
Maximizing PageRank with new Backlinks
For a given node t in a directed graph G(VG, EG) and a positive integer k we study the problem of computing a set of k new links pointing to t – so called backlinks to t – prod...
Martin Olsen