Pages that link to "Item:Q5402565"
From MaRDI portal
The following pages link to Node-and edge-deletion NP-complete problems (Q5402565):
Displaying 50 items.
- On judicious partitions of uniform hypergraphs (Q272317) (← links)
- Augmenting approach for some maximum set problems (Q284765) (← links)
- Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
- Clique cycle-transversals in distance-hereditary graphs (Q299045) (← links)
- Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
- Reducing rank of the adjacency matrix by graph modification (Q344771) (← links)
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- On judicious bisections of graphs (Q402590) (← links)
- An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
- On risk-averse maximum weighted subgraph problems (Q405680) (← links)
- An integer programming framework for critical elements detection in graphs (Q405684) (← links)
- Kernelization for cycle transversal problems (Q423937) (← links)
- Bicolored independent sets and bicliques (Q436317) (← links)
- \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
- A bound for judicious \(k\)-partitions of graphs (Q477337) (← links)
- Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- On the small cycle transversal of planar graphs (Q551170) (← links)
- Generating bicliques of a graph in lexicographic order (Q557825) (← links)
- More about NP-completeness in the frustration model of spin-glasses (Q580185) (← links)
- The max-cut problem on graphs not contractible to \(K_ 5\) (Q593988) (← links)
- Improved induced matchings in sparse graphs (Q608287) (← links)
- On a bipartition problem of Bollobás and Scott (Q624186) (← links)
- Energy efficient monitoring in sensor networks (Q627527) (← links)
- Hardness of subgraph and supergraph problems in \(c\)-tournaments (Q638528) (← links)
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- Edge-contraction problems (Q794164) (← links)
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- Optimal majority dynamics for the diffusion of an opinion when multiple alternatives are available (Q831148) (← links)
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs (Q884483) (← links)
- Finding small stabilizers for unstable graphs (Q896265) (← links)
- Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs (Q897592) (← links)
- The complexity of uniform Nash equilibria and related regular subgraph problems (Q935157) (← links)
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← links)
- On the complexity of some subgraph problems (Q967414) (← links)
- Optimal cuts in graphs and statistical mechanics (Q967941) (← links)
- Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem (Q969344) (← links)
- Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms (Q976036) (← links)
- Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 (Q1018104) (← links)
- Parameterized complexity of finding regular induced subgraphs (Q1026227) (← links)
- Bipartite density of triangle-free subcubic graphs (Q1028464) (← links)
- Scheduling jobs with fixed start and end times (Q1098765) (← links)
- A probabilistic estimator for the vertex deletion problem (Q1130419) (← links)
- On the removal of forbidden graphs by edge-deletion or by edge- contraction (Q1146698) (← links)
- Weakly bipartite graphs and the max-cut problem (Q1169411) (← links)
- The edge Hamiltonian path problem is NP-complete (Q1169818) (← links)
