A clever idea is frequently necessarily the key to solve mathematics problems from Prasolov books. Modern mathematics, especially the theory of NP-completeness starting from the classical book of [1], also gradually moves forward similarly. Continuing the years-long tale of that theory, we add another result claiming the hardness of one more problem, namely Maximum triangle-free induced subgraph
P versus NP is considered as one of the most important open problems in computer science. This consi...
We show optimal (up to a constant factor) NP-hardness for maximum constraint satisfaction problem wi...
AbstractWe show that the problem of finding a maximal vertex-induced (resp., edge-induced) subgraph ...
AbstractThe nonplanar vertex deletion or vertex deletion vd(G) of a graph G is the smallest nonnegat...
The nonplanar vertex deletion or vertex deletion vd (G) of a graph G is the smallest nonnegative int...
Proc. Toyohashi Symposium on Theoretical Computer Science, 97-101We show that the problem of finding...
International audienceIt is a long-standing open problem whether the minimal dominating sets of a gr...
AbstractWe prove that the maximum edge biclique problem in bipartite graphs is NP-complete
Given a graph G, the NP-hard Maximum Planar Subgraph problem (MPS) asks for a planar subgraph of G w...
AbstractIt is widely believed that showing a problem to be NP-complete is tantamount to proving its ...
AbstractGiven a graph G and an integer r, does there exist a regular subgraph of G with degree r? In...
We prove that the maximum edge biclique problem in bipartite graphs is NP-complete.A biclique in a b...
AbstractThe well-known greedy algorithm MIN for finding a maximal independent set in a graph G is ba...
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and...
An algorithm is said to be certifying if it outputs, together with a solution to the problem it solv...
P versus NP is considered as one of the most important open problems in computer science. This consi...
We show optimal (up to a constant factor) NP-hardness for maximum constraint satisfaction problem wi...
AbstractWe show that the problem of finding a maximal vertex-induced (resp., edge-induced) subgraph ...
AbstractThe nonplanar vertex deletion or vertex deletion vd(G) of a graph G is the smallest nonnegat...
The nonplanar vertex deletion or vertex deletion vd (G) of a graph G is the smallest nonnegative int...
Proc. Toyohashi Symposium on Theoretical Computer Science, 97-101We show that the problem of finding...
International audienceIt is a long-standing open problem whether the minimal dominating sets of a gr...
AbstractWe prove that the maximum edge biclique problem in bipartite graphs is NP-complete
Given a graph G, the NP-hard Maximum Planar Subgraph problem (MPS) asks for a planar subgraph of G w...
AbstractIt is widely believed that showing a problem to be NP-complete is tantamount to proving its ...
AbstractGiven a graph G and an integer r, does there exist a regular subgraph of G with degree r? In...
We prove that the maximum edge biclique problem in bipartite graphs is NP-complete.A biclique in a b...
AbstractThe well-known greedy algorithm MIN for finding a maximal independent set in a graph G is ba...
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and...
An algorithm is said to be certifying if it outputs, together with a solution to the problem it solv...
P versus NP is considered as one of the most important open problems in computer science. This consi...
We show optimal (up to a constant factor) NP-hardness for maximum constraint satisfaction problem wi...
AbstractWe show that the problem of finding a maximal vertex-induced (resp., edge-induced) subgraph ...
DOI
Add to ORKG