The following pages link to Nicola Apollonio (Q964477):
Displaying 3 items.
- Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs (Q5433194) (← links)
- Second-order moments of the size of randomly induced subgraphs of given order (Q6509771) (← links)
- Functions that are uniquely maximized by sparse quasi-star graphs, and uniquely minimized by quasi-complete graphs (Q6517140) (← links)
