scientific article; zbMATH DE number 3895108

From MaRDI portal

Revision as of 16:29, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5187320

Jump to:navigation, search

zbMath0562.05036MaRDI QIDQ5187320

Domenico Saccà, Alessandro D'Atri, Giorgio Ausiello

Publication date: 1985

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

zbMATH Keywords

computational complexity kernel polynomial algorithms NP-complete directed hypergraphs strong equivalence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Dynamic maintenance of directed hypergraphs ⋮ Flow hypergraph reducibility ⋮ Directed hypergraphs and applications

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5187320&oldid=19772902"