Pages that link to "Item:Q1589412"

The following pages link to Enumerating all connected maximal common subgraphs in two graphs (Q1589412):

Displaying 20 items.

• \textsc{Rime}: repeat identification (Q496543) (← links)
• An algorithm for reporting maximal \(c\)-cliques (Q817824) (← links)
• Communicability graph and community structures in complex networks (Q833142) (← links)
• The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810) (← links)
• Computing maximal cliques in link streams (Q897884) (← links)
• Refined pivot selection for maximal clique enumeration in graphs (Q899307) (← links)
• A note on the problem of reporting maximal cliques (Q955035) (← links)
• Isolation concepts for clique enumeration: comparison and computational experiments (Q1040581) (← links)
• Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581) (← links)
• On the complexity of submap isomorphism and maximum common submap problems (Q1677051) (← links)
• The journey of graph kernels through two decades (Q1706611) (← links)
• A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525) (← links)
• A fast discovery algorithm for large common connected induced subgraphs (Q2274094) (← links)
• Enumerating all maximal biclusters in numerical datasets (Q2292925) (← links)
• Comparing and distinguishing the structure of biological branching (Q2351339) (← links)
• All roads lead to Rome -- new search methods for the optimal triangulation problem (Q2375332) (← links)
• Maximum common induced subgraph parameterized by vertex cover (Q2445395) (← links)
• A linear time algorithm for maximal clique enumeration in large sparse graphs (Q2628285) (← links)
• Maximal independent sets in clique-free graphs (Q2674559) (← links)
• A shift-based model to solve the integrated staff rostering and task assignment problem with real-world requirements (Q6113339) (← links)