Sciweavers

33 search results - page 2 / 7
» The basis number of the powers of the complete graph
Sort
View
STACS
2007
Springer
13 years 12 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
13 years 9 months ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 5 months ago
Randomness for Free
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...
Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert...
ADAEUROPE
2008
Springer
14 years 3 days ago
A Framework for CFG-Based Static Program Analysis of Ada Programs
Abstract. The control flow graph is the basis for many code optimisation and analysis techniques. We introduce a new framework for the construction of powerful CFG-based represent...
Raul Fechete, Georg Kienesberger, Johann Blieberge...
CPAIOR
2010
Springer
13 years 3 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey