Pages that link to "Item:Q5916096"
From MaRDI portal
The following pages link to A polyhedral study of the maximum edge subgraph problem (Q5916096):
Displaying 8 items.
- Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
- Polyhedral study of the connected subgraph problem (Q468440) (← links)
- Exact and heuristic algorithms for the weighted total domination problem (Q2027027) (← links)
- Combinatorial properties and further facets of maximum edge subgraph polytopes (Q2840727) (← links)
- (Q3023951) (← links)
- Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems (Q4018843) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5891092) (← links)
- The sparse sequences of graphs (Q6640961) (← links)