Suchergebnisse - "Output-polynomial algorithm"

An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems von Könen, David, Stiglmayr, Michael

“… This paper addresses the problem of enumerating all supported efficient solutions for a linear multi-objective integer minimum cost flow problem (MOIMCF). It …”
Volltext

Enumerating minimal dominating sets in chordal bipartite graphs von Golovach, Petr A., Heggernes, Pinar, Kanté, Mamadou M., Kratsch, Dieter, Villanger, Yngve

“… We show that all minimal dominating sets of a chordal bipartite graph can be generated in incremental polynomial, hence output polynomial, time. Enumeration of …”
Volltext

Computational aspects of monotone dualization: A brief survey von Eiter, Thomas, Makino, Kazuhisa, Gottlob, Georg

“… Dualization of a monotone Boolean function represented by a conjunctive normal form (CNF) is a problem which, in different disguise, is ubiquitous in many …”
Volltext

New Results on Monotone Dualization and Generating Hypergraph Transversals von Eiter, Thomas, Gottlob, Georg, Makino, Kazuhisa

“… We consider the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph) whose associated decision problem is a …”
Volltext

Identifying the Minimal Transversals of a Hypergraph and Related Problems von Eiter, Thomas, Gottlob, Georg

“… The paper considers two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, and discusses their significance …”
Volltext

Generating all maximal models of a Boolean expression von Kavvadias, Dimitris J., Sideri, Martha, Stavropoulos, Elias C.

“… We present an output-polynomial algorithm for the 2CNF case and we show that the problem cannot be solved in output-polynomial time in the case of Horn expressions, unless P …”
Volltext

Enumerating all geodesics von Wild, Marcel

“… from \(v_1\) to \(v_k\). We propose a novel, output-polynomial algorithm to enumerate all geodesics of \(G …”
Volltext

A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs von Kanté, Mamadou Moustapha, Limouzy, Vincent, Arnaud, Mary, Nourine, Lhouari, Uno, Takeaki

“… An output-polynomial algorithm for the listing of minimal dominating sets in graphs is a challenging open problem and is known to be equivalent to the well-known Transversal problem which asks …”
Volltext

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets von Bonamy, Marthe, Defrain, Oscar, Micek, Piotr, Nourine, Lhouari

“… Through a different proof technique, we also provide an output-polynomial algorithm for their complements, i.e …”
Volltext

Computing all Wardrop Equilibria parametrized by the Flow Demand von Klimm, Max, Warode, Philipp

“… We develop an algorithm that computes for a given undirected or directed network with flow-dependent piece-wise linear edge cost functions all Wardrop …”
Volltext

Proximity Search For Maximal Subgraph Enumeration von Conte, Alessio, Marino, Andrea, Grossi, Roberto, Uno, Takeaki, Versari, Luca

“… be solved by existing frameworks. To support this claim and illustrate the technique we include output-polynomial algorithms for several problems for which output-polynomial algorithms were not known, including the enumeration …”
Volltext