Algorithm Theory - SWAT 2004
From MaRDI portal
Publication:5315378
Recommendations
Cited in
(95)- On Independent Sets and Bicliques in Graphs
- Coloring \((4K_1,C_4,C_6)\)-free graphs
- A linear time algorithm for maximal clique enumeration in large sparse graphs
- Consensus algorithms for the generation of all maximal bicliques
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- A superclass of edge-path-tree graphs with few cliques
- Combinatorial problems on \(H\)-graphs
- A note on the problem of reporting maximal cliques
- A new decomposition technique for maximal clique enumeration for sparse graphs
- Mining preserving structures in a graph sequence
- Polynomial delay algorithm for listing minimal edge dominating sets in graphs
- Maximum weight edge-constrained matchings
- Bicolored independent sets and bicliques
- Parallel Algorithm for Enumerating Maximal Cliques in Complex Network
- On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs
- Computational aspects of monotone dualization: a brief survey
- An efficient algorithm for solving pseudo clique enumeration problem
- An Efficient Algorithm for Enumerating Pseudo Cliques
- Maximal independent sets in clique-free graphs
- Co-bipartite neighborhood edge elimination orderings
- Exact algorithms for maximum clique: a computational study
- On the computation of fixed points in Boolean networks
- Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques
- Weighted maximum-clique transversal sets of graphs
- On the generation of bicliques of a graph
- Theoretical underpinnings for maximal clique enumeration on perturbed graphs
- An algorithm for reporting maximal \(c\)-cliques
- On finding \(k\)-cliques in \(k\)-partite graphs
- scientific article; zbMATH DE number 434864 (Why is no real title available?)
- Finding all maximal cliques in dynamic graphs
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- Graph-based data clustering with overlaps
- Efficient enumeration of dominating sets for sparse graphs
- Computing maximal cliques in link streams
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- An output sensitive algorithm for maximal clique enumeration in sparse graphs
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Efficient enumeration of dominating sets for sparse graphs
- Efficient enumeration of maximal induced bicliques
- Coloring square-free Berge graphs
- Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
- Efficient pattern matching on big uncertain graphs
- Enumerating all solutions of a Boolean CSP by non-decreasing weight
- Fast maximal cliques enumeration in sparse graphs
- Enumeration aspects of maximal cliques and bicliques
- On independent sets and bicliques in graphs
- Variations of maximum-clique transversal sets on graphs
- On the complexity of computing treelength
- Triangulated neighborhoods in even-hole-free graphs
- Interesting pattern mining in multi-relational data
- Finding lasting dense subgraphs
- A polynomial Turing-kernel for weighted independent set in bull-free graphs
- Enumeration of all wedged equilibrium configurations in contact problem with Coulomb friction
- On the fractional chromatic number of monotone self-dual Boolean functions
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
- Recognizing Helly edge-path-tree graphs and their clique graphs
- A New Algorithm for Computing the Maximal Closure of a Graph
- Efficiently enumerating all maximal cliques with bit-parallelism
- On maximal chain subgraphs and covers of bipartite graphs
- Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search
- Unranking of small combinations from large sets
- Enumerating maximal cliques in large sparse graphs
- On maximal cliques with connectivity constraints in directed graphs
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
- On \(H\)-topological intersection graphs
- Structural parameterizations with modulator oblivion
- Linear-time algorithm for generating c-isolated bicliques
- On the Parameterized Complexity of Clique Elimination Distance
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
- Minimum cost flow problem with conflicts
- Listing subgraphs by Cartesian decomposition
- Compact structure for sparse undirected graphs based on a clique graph partition
- Structural parameterizations with modulator oblivion
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
- Listing Maximal Independent Sets with Minimal Space and Bounded Delay
- Enumerating minimal transversals of hypergraphs without small holes
- Bisimplicial separators
- Maximal strongly connected cliques in directed graphs: algorithms and bounds
- How to hide a clique?
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
- Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
- Auto-g-computation of causal effects on a network
- On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs
- Problems and invariants connected with bicliques and multicliques of graphs
- Graph-Based Data Clustering with Overlaps
- Enumerating all maximal biclusters in numerical datasets
- On computing the Galois lattice of bipartite distance hereditary graphs
- Tight lower bounds on the number of bicliques in false-twin-free graphs
- Polynomial-delay and polynomial-space enumeration of large maximal matchings
- A new approximate cluster deletion algorithm for diamond-free graphs
- Generating clause sequences of a CNF formula
- A New Approach for Solving the Maximum Clique Problem
This page was built for publication: Algorithm Theory - SWAT 2004
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315378)
