Kratsch Dieter

Dieter Kratsch

Information about the author Dieter Kratsch will soon be added to the site.
Found 8 papers in total
Finding Shortest Paths Between Graph Colourings
Finding Shortest Paths Between Graph Colourings
2016
The k ‐colouring reconfiguration problem asks whether, for a given graph G ,...
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets
2015
We show that all minimal edge dominating sets of a graph can be generated in...
Computing Optimal Steiner Trees in Polynomial Space
Computing Optimal Steiner Trees in Polynomial Space
2013
Given an n ‐node edge‐weighted graph and a subset of k terminal nodes,...
On Independent Sets and Bicliques in Graphs
On Independent Sets and Bicliques in Graphs
2012
Bicliques of graphs have been studied extensively, partially motivated by the large...
Branch and Recharge: Exact Algorithms for Generalized Domination
Branch and Recharge: Exact Algorithms for Generalized Domination
2011
In this paper we present branching algorithms for infinite classes of problems. The...
Exact Algorithms for L(2,1)‐Labeling of Graphs
Exact Algorithms for L(2,1)‐Labeling of Graphs
2011
The notion of distance constrained graph labelings, motivated by the Frequency...
Domination and total domination on asteroidal triple-free graphs
Domination and total domination on asteroidal triple-free graphs
2000
We present the first polynomial time algorithms for solving the NP-complete graph...
Chordality and 2-factors in tough graphs
Chordality and 2-factors in tough graphs
2000
A graph G is chordal if it contains no chordless cycle of length at least four and is...
Papers per page: