Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3
Year: 2017
Type: article
Institution: University of Salerno
Language: English
Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W2608355501
