scientific article; zbMATH DE number 1154176

zbMath0890.06002MaRDI QIDQ4389705

Martin Gavalec

Publication date: 18 May 1998

Full work available at URL: https://eudml.org/doc/34438

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-completenesspolynomial algorithmpartial orderconsistent choice problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06)

Cites Work

• Unnamed Item
• The Problem of Compatible Representatives
• Balanced location on a graph
• Depth-First Search and Linear Graph Algorithms
• The complexity of theorem-proving procedures

This page was built for publication: