Decidability Questions for Graph k - CoveringsFran

  • Frann Cois Demichelis, Wiess Law Zielonka
  • Published 1997


The notion of k-coverings of graphs, used previously in order to demonstrate some impossibility results for local graph computations, is investigated systematically. It turns out that, unlike the classical graph coverings where a simple method exists to construct them eeec-tively for a given graph, k-coverings do not admit any such algorithm | the problem… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics