Le problème d'étoiles pour graphes est NP-complèt
From MaRDI portal
Publication:1151755
DOI10.1016/0012-365X(81)90271-5zbMath0458.68025OpenAlexW2084665552MaRDI QIDQ1151755
Publication date: 1981
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(81)90271-5
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)
Related Items (7)
On the complexity of reconstructing H-free graphs from their Star Systems ⋮ Solving the canonical representation and star system problems for proper circular-arc graphs in logspace ⋮ Neighborhood hypergraphs of digraphs and some matrix permutation problems ⋮ Graph isomorphism restricted by lists ⋮ On the Complexity of Reconstructing H-free Graphs from Their Star Systems ⋮ Reconstructing Cactus Graphs from Shortest Path Information ⋮ Graph isomorphism problem
Cites Work
This page was built for publication: Le problème d'étoiles pour graphes est NP-complèt
