The following pages link to Algorithm Theory - SWAT 2004 (Q5315378):
Displaying 50 items.
- Mining preserving structures in a graph sequence (Q344786) (← links)
- On finding \(k\)-cliques in \(k\)-partite graphs (Q360493) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Bicolored independent sets and bicliques (Q436317) (← links)
- Graph-based data clustering with overlaps (Q456688) (← links)
- Unranking of small combinations from large sets (Q473209) (← links)
- A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) (← links)
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions (Q646712) (← links)
- Enumeration of all wedged equilibrium configurations in contact problem with Coulomb friction (Q649238) (← links)
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- Interesting pattern mining in multi-relational data (Q740605) (← links)
- An algorithm for reporting maximal \(c\)-cliques (Q817824) (← links)
- An efficient algorithm for solving pseudo clique enumeration problem (Q848935) (← links)
- The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810) (← links)
- Triangulated neighborhoods in even-hole-free graphs (Q870966) (← links)
- Computing maximal cliques in link streams (Q897884) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- A note on the problem of reporting maximal cliques (Q955035) (← links)
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← links)
- On the complexity of computing treelength (Q972342) (← links)
- Theoretical underpinnings for maximal clique enumeration on perturbed graphs (Q974747) (← links)
- On the fractional chromatic number of monotone self-dual Boolean functions (Q1011723) (← links)
- Enumeration aspects of maximal cliques and bicliques (Q1028116) (← links)
- A superclass of edge-path-tree graphs with few cliques (Q1038105) (← links)
- Finding all maximal cliques in dynamic graphs (Q1424782) (← links)
- Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- Efficient pattern matching on big uncertain graphs (Q1671698) (← links)
- Combinatorial problems on \(H\)-graphs (Q1689915) (← links)
- Co-bipartite neighborhood edge elimination orderings (Q1689989) (← links)
- Coloring square-free Berge graphs (Q1719576) (← links)
- Exact algorithms for maximum clique: a computational study (Q1736530) (← links)
- A new decomposition technique for maximal clique enumeration for sparse graphs (Q1740688) (← links)
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication (Q1799209) (← links)
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563) (← links)
- Fast maximal cliques enumeration in sparse graphs (Q1949748) (← links)
- Maximal strongly connected cliques in directed graphs: algorithms and bounds (Q1983136) (← links)
- Efficient enumeration of maximal induced bicliques (Q1983137) (← links)
- Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs (Q1987232) (← links)
- Exact solution algorithms for the maximum flow problem with additional conflict constraints (Q2023909) (← links)
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (Q2034408) (← links)
- Compact structure for sparse undirected graphs based on a clique graph partition (Q2054100) (← links)
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2062119) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- Finding lasting dense subgraphs (Q2218373) (← links)
- Generating clause sequences of a CNF formula (Q2219060) (← links)
- Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2232246) (← links)
- Recognizing Helly edge-path-tree graphs and their clique graphs (Q2275917) (← links)
- A new approximate cluster deletion algorithm for diamond-free graphs (Q2292150) (← links)
