The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
From MaRDI portal
Cited in
(27)- The largest tree in a random graph
- Combinatorial problems over power sets
- Submatrices of non-tree-realizable distance matrices
- \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems
- Trees related to realizations of distance matrices
- Polynomial kernels for deletion to classes of acyclic digraphs
- On the NP-hardness of edge-deletion and -contraction problems
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds
- Navigating planar topologies in near-optimal space and time
- Finding connected secluded subgraphs
- On the connectivity preserving minimum cut problem
- Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- The approximation of maximum subgraph problems
- An approximate kernel for connected feedback vertex set
- On the approximability of the maximum common subgraph problem
- Finding connected secluded subgraphs
- CNF and DNF succinct graph encodings
- Tree deletion set has a polynomial kernel but no \(\mathrm{OPT}^\mathcal{O}(1)\) approximation)
- Parameterized algorithms for finding highly connected solution
- Parameterized algorithms for finding highly connected solution
- Edge deletion to tree-like graph classes
- How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks
- Attaining equilibria using control sets
- Attaining equilibria using control sets
- Edge-contraction problems
- On the complexity of some subgraph problems
This page was built for publication: The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3854626)
