Pages that link to "Item:Q1278276"

The following pages link to On finding a biconnected spanning planar subgraph with applications to the facilities layout problem (Q1278276):

Displaying 2 items.

• A heuristic approach for dividing graphs into bi-connected components with a size constraint (Q2403269) (← links)
• Maximum weight matching and genetic algorithm for fixed-shape facility layout problem (Q3605401) (← links)