The following pages link to Max Ward (Q781013):
Displaying 5 items.
- Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition (Q781014) (← links)
- A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints (Q2985118) (← links)
- A Faster Algorithm for Maximum Induced Matchings on Circle Graphs (Q4585063) (← links)
- A faster algorithm for maximum independent set on interval filament graphs (Q5084714) (← links)
- Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard (Q6121418) (← links)
