#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2007

2010

- This year (0)
- Last 5 years (0)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Torsten Korneffel, Eberhard Triesch
- Combinatorica
- 2010

Let V be a set of vertices with |V |=n and E=V2 ) the set of all 2-element subsets of V , called the set of edges. A graph property P on V is a set of graphs with vertex set V (i.e., P ⊆ 2E), that is invariant under permutation of the vertices. Given such a property, we want to decide if an unknown graph G has the property, i.e., G∈P. We model this task as… (More)

- Torsten Korneffel, Dirk Meierling, Lutz Volkmann
- Discussiones Mathematicae Graph Theory
- 2008

A subset D of the vertex set of a graph G is a (k, p)-dominating set if every vertex v ∈ V (G) \ D is within distance k to at least p vertices in D. The parameter γk,p(G) denotes the minimum cardinality of a (k, p)-dominating set of G. In 1994, Bean, Henning and Swart posed the conjecture that γk,p(G) ≤ p p+k n(G) for any graph G with δk(G) ≥ k + p − 1,… (More)

Preface Reality provides many examples of something we call a search. Informally, we may have a goal (e.g., finding a lost key, a damaged light bulb, the shortest way to the next bus stop) and a set of possible actions to gain some information. All possible action needs some time, money, work etc., so that we want to calculate the expenses of our search… (More)

- Zhihong He, Torsten Korneffel, Dirk Meierling, Lutz Volkmann, Stefan Winzen
- Discrete Mathematics
- 2009

- ‹
- 1
- ›