Pages that link to "Item:Q860810"
From MaRDI portal
The following pages link to The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810):
Displayed 32 items.
- Use of a novel grammatical inference approach in classification of amyloidogenic hexapeptides (Q332896) (← links)
- Mining preserving structures in a graph sequence (Q344786) (← links)
- Characteristics of the maximal independent set ZDD (Q405673) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Stochastic stability in best shot network games (Q423720) (← links)
- On the termination of some biclique operators on multipartite graphs (Q496448) (← links)
- Communicability graph and community structures in complex networks (Q833142) (← links)
- Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
- An efficient algorithm for solving pseudo clique enumeration problem (Q848935) (← links)
- Computing maximal cliques in link streams (Q897884) (← links)
- Refined pivot selection for maximal clique enumeration in graphs (Q899307) (← links)
- SQBC: an efficient subgraph matching method over large and dense graphs (Q903609) (← links)
- A note on the problem of reporting maximal cliques (Q955035) (← links)
- Theoretical underpinnings for maximal clique enumeration on perturbed graphs (Q974747) (← links)
- Isolation concepts for clique enumeration: comparison and computational experiments (Q1040581) (← links)
- Toward uniform random generation in 1-safe Petri nets (Q1687776) (← links)
- Enumerating maximal cliques in link streams with durations (Q1705705) (← links)
- A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
- Fast maximal cliques enumeration in sparse graphs (Q1949748) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077) (← links)
- Synthesizing cubes to satisfy a given intersection pattern (Q2355742) (← links)
- An extended depth-first search algorithm for optimal triangulation of Bayesian networks (Q2374531) (← links)
- All roads lead to Rome -- new search methods for the optimal triangulation problem (Q2375332) (← links)
- Efficient algorithms for dualizing large-scale hypergraphs (Q2449091) (← links)
- A linear time algorithm for maximal clique enumeration in large sparse graphs (Q2628285) (← links)
- Fuzzy Clustering based on Coverings (Q2829662) (← links)
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894) (← links)
- Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472) (← links)
- Parallel Algorithm for Enumerating Maximal Cliques in Complex Network (Q3627914) (← links)
- An Efficient Algorithm for Enumerating Pseudo Cliques (Q5387774) (← links)
- Enumerating Isolated Cliques in Synthetic and Financial Networks (Q5505678) (← links)