Partitioning of the Minimum Essential Set Construction Problem

DOI10.1016/S0167-5060(08)70706-4zbMath0455.05033OpenAlexW325006302MaRDI QIDQ3903027

Aram K. Kevorkian

Publication date: 1980

Published in: Combinatorial Mathematics, Optimal Designs and Their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70706-4

zbMATH Keywords

NP-completereconstruction problemmaximum stable setessential setminimum feedback vertex setstrongly connected directed graphminimum essential setbreak vertexstrongly adjacent polygon

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

This page was built for publication: Partitioning of the Minimum Essential Set Construction Problem