Pages that link to "Item:Q3521912"
From MaRDI portal
The following pages link to A New Combinatorial Approach for Sparse Graph Problems (Q3521912):
Displaying 9 items.
- On minimum witnesses for Boolean matrix multiplication (Q517804) (← links)
- A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph (Q2032176) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- A survey of the all-pairs shortest paths problem and its variants in graphs (Q2629565) (← links)
- A note on the complexity of computing the number of reachable vertices in a digraph (Q2629773) (← links)
- (Q3024759) (← links)
- NEW SPARSENESS RESULTS ON GRAPH SPANNERS (Q4698355) (← links)
- Fine-grained complexity for sparse graphs (Q5230293) (← links)
- (Q5743466) (← links)