A Constant Time Algorithm for Domination Problems on Polygraphs

Polona Pavlic, Janez Zerovnik. A Constant Time Algorithm for Domination Problems on Polygraphs. In Andreas Brieden, Zafer-Korcan Görgülü, Tino Krug, Erik Kropat, Silja Meyer-Nieberg, Goran Mihelcic, Stefan Wolfgang Pickl, editors, 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Munich, Germany, May 29-31, 2012. Extended Abstracts. pages 205-209, 2012.

Abstract

Abstract is missing.