Pages that link to "Item:Q2840513"
From MaRDI portal
The following pages link to A branch \& cut algorithm for the maximum common edge subgraph problem (Q2840513):
Displaying 5 items.
- Observations from parallelising three maximum common (connected) subgraph algorithms (Q1626749) (← links)
- The maximum common edge subgraph problem: A polyhedral investigation (Q1759826) (← links)
- Polyhedral study of the maximum common induced subgraph problem (Q1761750) (← links)
- (Q5005670) (← links)
- Formulations for the maximum common edge subgraph problem (Q6193953) (← links)