Sciweavers

3204 search results - page 115 / 641
» The Alcuin Number of a Graph
Sort
View
WADS
2005
Springer
145views Algorithms» more  WADS 2005»
14 years 1 months ago
Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
Victor Chepoi, Bertrand Estellon, Yann Vaxè...
DM
1999
61views more  DM 1999»
13 years 7 months ago
On an equivalence in discrete extremal problems
We introduce some equivalence relations on graphs and posets and prove that they are closed under the cartesian product operation. These relations concern the edge-isoperimetric p...
Sergei L. Bezrukov
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
13 years 6 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
CORR
2011
Springer
141views Education» more  CORR 2011»
13 years 3 months ago
Geometric Semigroup Theory
Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show h...
Jon McCammond, John Rhodes, Benjamin Steinberg
ECAI
1994
Springer
14 years 8 days ago
Concept Language with Number Restrictions and Fixpoints, and its Relationship with Mu-calculus
Abstract. Many recent works point out that there are several possibilities of assigning a meaning to a concept definition containing some sort of recursion. In this paper, we argue...
Giuseppe De Giacomo, Maurizio Lenzerini