Pages that link to "Item:Q1877711"
From MaRDI portal
The following pages link to Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (Q1877711):
Displaying 14 items.
- On bounded block decomposition problems for under-specified systems of equations (Q414888) (← links)
- Constraint bipartite vertex cover: simpler exact algorithms and implementations (Q431922) (← links)
- Observability analysis and sensor location study for structured linear systems in descriptor form with unknown inputs (Q665197) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- State and input observability recovering by additional sensor implementation: a graph-theoretic approach (Q963983) (← links)
- Cardinality constrained and multicriteria (multi)cut problems (Q1013079) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- Multi-Budgeted Directed Cuts (Q5009480) (← links)
- On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs (Q5084707) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective (Q6151150) (← links)
