Computing dense and sparse subgraphs of weakly closed graphs
From MaRDI portal
Publication:6107896
DOI10.1007/s00453-022-01090-zarXiv2007.05630OpenAlexW3042137000MaRDI QIDQ6107896
Frank Sommer, Christian Komusiewicz, Tomohiro Koana
Publication date: 28 June 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.05630
Cites Work
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Bicolored independent sets and bicliques
- Finding large \(k\)-clubs in undirected graphs
- A note on an induced subgraph characterization of domination perfect graphs
- Dominating set is fixed parameter tractable in claw-free graphs
- Isolation concepts for efficiently enumerating dense subgraphs
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- On problems without polynomial kernels
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Some simplified NP-complete graph problems
- Arboricity and bipartite subgraph listing algorithms
- The maximum edge biclique problem is NP-complete
- Multivariate algorithmics for finding cohesive subnetworks
- Parameterized computational complexity of finding small-diameter subgraphs
- Parameterized complexity of finding subgraphs with hereditary properties.
- Efficient enumeration of maximal induced bicliques
- Detecting and enumerating small induced subgraphs in \(c\)-closed graphs
- On structural parameterizations for the 2-club problem
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
- On independent sets and bicliques in graphs
- Parameterized algorithms for edge biclique and related problems
- Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
- The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
- Arboricity and Subgraph Listing Algorithms
- Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
- The Parameterized Complexity of the k -Biclique Problem
- Deciding First-Order Properties of Nowhere Dense Graphs
- An induced subgraph characterization of domination perfect graphs
- Kernelization Lower Bounds by Cross-Composition
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems
- Finding Cliques in Social Networks: A New Distribution-Free Model
- Listing All Maximal Cliques in Large Sparse Real-World Graphs
- Parameterized Complexity for Domination Problems on Degenerate Graphs
- Parameterized Algorithms
- Geodetic graphs of diameter two
- On cliques in graphs
- Essentially tight kernels for (weakly) closed graphs
This page was built for publication: Computing dense and sparse subgraphs of weakly closed graphs
