Finding large degree-anonymous subgraphs is hard
Date
2016Dewey
Recherche opérationnelleSujet
Complexity; NP-hardness; Approximation-hardness; W-hardness; Graph algorithmsJEL code
C.C4.C44Journal issue
Theoretical Computer ScienceVolume
622Publication date
04-2016Article pages
90-110Publisher
ElsevierCollections
Metadata
Show full item recordAuthor
Bazgan, Cristina
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Bredereck, Robert
84325 Department of Software Engineering and Theoretical Computer Science [SWT - TUB]
Hartung, Sepp
84325 Department of Software Engineering and Theoretical Computer Science [SWT - TUB]
Nichterlein, André
84325 Department of Software Engineering and Theoretical Computer Science [SWT - TUB]
Woeginger, Gerhard
238519 Department of mathematics and computing science [Eindhoven]