Pages that link to "Item:Q3921261"
From MaRDI portal
The following pages link to Node-Deletion Problems on Bipartite Graphs (Q3921261):
Displaying 50 items.
- Augmenting approach for some maximum set problems (Q284765) (← links)
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981) (← links)
- Bandwidth of chain graphs (Q293476) (← links)
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- Graph modification problem for some classes of graphs (Q350726) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- On the weighted \(k\)-path vertex cover problem (Q406316) (← links)
- Minimum \(d\)-blockers and \(d\)-transversals in graphs (Q411244) (← links)
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
- Some new considerations about double nested graphs (Q490902) (← links)
- Approximate association via dissociation (Q505447) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888) (← links)
- Matching interdiction (Q602686) (← links)
- The chain graph sandwich problem (Q646705) (← links)
- A characterization of chain probe graphs (Q646709) (← links)
- Two characterizations of chain partitioned probe graphs (Q646714) (← links)
- On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- Edge-contraction problems (Q794164) (← links)
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← links)
- A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
- An efficient algorithm for minimum feedback vertex sets in rotator graphs (Q987789) (← links)
- The induced matching and chain subgraph cover problems for convex bipartite graphs (Q995582) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Some results on graphs without long induced paths (Q1029004) (← links)
- Blockers and transversals (Q1043948) (← links)
- Implications of forbidden structures for extremal algorithmic problems (Q1082812) (← links)
- The maximum k-colorable subgraph problem for chordal graphs (Q1108038) (← links)
- A probabilistic estimator for the vertex deletion problem (Q1130419) (← links)
- \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems (Q1177173) (← links)
- On the complexity of the k-chain subgraph cover problem (Q1275070) (← links)
- On Halin subgraphs and supergraphs (Q1343152) (← links)
- Recognizing interval digraphs and interval bigraphs in polynomial time (Q1377666) (← links)
- Monotonizing linear programs with up to two nonzeroes per column (Q1433661) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923) (← links)
- The maximum cardinality cut problem in co-bipartite chain graphs (Q1698075) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- Vertex deletion problems on chordal graphs (Q1786595) (← links)
- On sum coloring of graphs (Q1811069) (← links)
- A good submatrix is hard to find (Q1836717) (← links)
- Complexity of learning in concept lattices from positive and negative examples (Q1878406) (← links)
- Optimal edge ranking of trees in polynomial time (Q1892584) (← links)
- On edge perfectness and classes of bipartite graphs (Q1910576) (← links)
- Algorithms for induced biclique optimization problems (Q1944925) (← links)
