Pages that link to "Item:Q5710818"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5710818):
Displaying 8 items.
- Efficient algorithms for a graph partitioning problem (Q777267) (← links)
- Most uniform path partitioning and its use in image processing (Q1803677) (← links)
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two (Q1949099) (← links)
- Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size (Q2466001) (← links)
- Partitioning a Weighted Tree to Subtrees of Almost Uniform Size (Q3596718) (← links)
- Max-min partitioning of grid graphs into connected components (Q4540070) (← links)
- Computing Weighted Strength and Applications to Partitioning (Q4558887) (← links)
- Minimum nonuniform graph partitioning with unrelated weights (Q4610203) (← links)