Pages that link to "Item:Q967414"
From MaRDI portal
The following pages link to On the complexity of some subgraph problems (Q967414):
Displaying 15 items.
- Parameterized complexity of connected even/odd subgraph problems (Q395000) (← links)
- The complexity of regular subgraph recognition (Q912615) (← links)
- A note on the complexity of finding regular subgraphs (Q1059641) (← links)
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound (Q1071037) (← links)
- The maximum k-colorable subgraph problem for chordal graphs (Q1108038) (← links)
- Maximal chordal subgraphs (Q1115455) (← links)
- On the complexity of the k-chain subgraph cover problem (Q1275070) (← links)
- On the complexity of finite subgraphs of the curve graph (Q1626407) (← links)
- Complexity of some graph-based bounds on the probability of a union of events (Q1752603) (← links)
- On the \(k\)-edge-incident subgraph problem and its variants (Q2446891) (← links)
- Evasiveness of subgraph containment and related properties (Q2784484) (← links)
- The Complexity of Acyclic Subhypergraph Problems (Q3078379) (← links)
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
- Systematized approaches to the complexity of subgraph problems (Q3985346) (← links)
- Subtraction-free complexity, cluster transformations, and spanning trees (Q5963078) (← links)