Login / Signup
Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs.
Matthew Johnson
Barnaby Martin
Sukanya Pandey
Daniël Paulusma
Siani Smith
Erik Jan van Leeuwen
Published in:
MFCS (2023)
Keyphrases
</>
np complete
computational complexity
data mining
application domains
decision problems
social network analysis
directed graph
computational problems
np hard
semi supervised
main contribution
series parallel
polynomial hierarchy
dense subgraphs
subgraph matching