Assessing the computational complexity of multilayer subgraph detection

Keyphrases

• Computational Complexity 100%
• Multilayer Graph 100%
• Graph Anomaly Detection 100%
• Vertex Set 50%
• Real-world Problems 50%
• Relationship Types 50%
• Hardness Results 50%
• Detection Problem 50%
• Relaxed Problem 50%
• Tractability 50%
• Edge Set 50%
• Maximum Cardinality Matching 50%
• Path Problems 50%
• Computational Tractability 50%
• Clique Relaxations 50%

Computer Science

• Subgraphs 100%
• Computational Complexity 100%
• Fundamental Problem 50%
• Cardinality 50%
• Real-World Problem 50%

Mathematics

• Edge 100%
• World Problems 50%
• Cardinality 50%
• Clique 50%
• Path Problem 50%