1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2014
Notes on dual-critical graphs
Zoltán Király, Sándor Kisfaludi-Bak
We define dual-critical graphs as graphs having an acyclic orientation, where the indegrees are odd except for the unique source. We have very limited knowledge about the complexit…
cs.DS2014
Shortest Paths in Nearly Conservative Digraphs
Zoltán Király
We introduce the following notion: a digraph with arc weights is called nearly conservative if every negative cycle consists of two arcs. Computing s…
cs.CC2014★ 1 cited
On the tractability of some natural packing, covering and partitioning problems
Attila Bernáth, Zoltán Király
In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuits, forests, spanning trees, (not necessarily spanning) trees and cuts. Given an…