Pages that link to "Item:Q3854626"
From MaRDI portal
The following pages link to The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems (Q3854626):
Displaying 27 items.
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- CNF and DNF succinct graph encodings (Q515682) (← links)
- Edge-contraction problems (Q794164) (← links)
- On the complexity of some subgraph problems (Q967414) (← links)
- The largest tree in a random graph (Q1050116) (← links)
- Combinatorial problems over power sets (Q1143948) (← links)
- Submatrices of non-tree-realizable distance matrices (Q1163034) (← links)
- \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems (Q1177173) (← links)
- Trees related to realizations of distance matrices (Q1584445) (← links)
- Polynomial kernels for deletion to classes of acyclic digraphs (Q1751231) (← links)
- On the NP-hardness of edge-deletion and -contraction problems (Q1838829) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Navigating planar topologies in near-optimal space and time (Q2096370) (← links)
- Finding connected secluded subgraphs (Q2186823) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- On the connectivity preserving minimum cut problem (Q2637652) (← links)
- BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES (Q2905308) (← links)
- The approximation of maximum subgraph problems (Q4630247) (← links)
- (Q5075825) (← links)
- On the approximability of the maximum common subgraph problem (Q5096796) (← links)
- (Q5111877) (← links)
- Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) (Q5741082) (← links)
- Parameterized algorithms for finding highly connected solution (Q5918560) (← links)
- Fast and compact planar embeddings (Q5918983) (← links)
- Parameterized algorithms for finding highly connected solution (Q5970787) (← links)
- Edge deletion to tree-like graph classes (Q6124427) (← links)
- How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks (Q6162049) (← links)
