SQBC: an efficient subgraph matching method over large and dense graphs (Q903609): Difference between revisions

@@ Property / describes a project that uses @@
+GraphGrep
@@ Property / describes a project that uses: GraphGrep / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ins.2013.10.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2164292538
@@ Property / OpenAlex ID: W2164292538 / rank @@
+Normal rank
@@ Property / cites work @@
+Vehicle routing with a sparse feasibility graph
@@ Property / cites work: Vehicle routing with a sparse feasibility graph / rank @@
+Normal rank
@@ Property / cites work @@
+Simple ingredients leading to very efficient heuristics for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+An effective local search for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+On Finding Dense Subgraphs
@@ Property / cites work: On Finding Dense Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for the maximum clique problem
@@ Property / cites work: A fast algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
+Normal rank
@@ Property / cites work @@
+A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
+Normal rank
@@ Property / cites work @@
+The worst-case time complexity for generating all maximal cliques and computational experiments
+Normal rank
@@ Property / cites work @@
+An Algorithm for Subgraph Isomorphism
@@ Property / cites work: An Algorithm for Subgraph Isomorphism / rank @@
+Normal rank