Sciweavers

2503 search results - page 438 / 501
» A study of 3-arc graphs
Sort
View
IANDC
2006
82views more  IANDC 2006»
13 years 7 months ago
Recognizability, hypergraph operations, and logical types
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which ...
Achim Blumensath, Bruno Courcelle
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 7 months ago
Automatic Structures: Richness and Limitations
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
Bakhadyr Khoussainov, André Nies, Sasha Rub...
JCO
2008
117views more  JCO 2008»
13 years 7 months ago
Approximation algorithms for connected facility location problems
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong C...
CORR
2007
Springer
108views Education» more  CORR 2007»
13 years 7 months ago
Scuba Search : when selection meets innovation
— We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality in fitness landscape....
Sébastien Vérel, Philippe Collard, M...
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 7 months ago
Normalisation Control in Deep Inference Via Atomic Flows
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
Alessio Guglielmi, Tom Gundersen