The following pages link to Srinivasa R. Arikati (Q686256):
Displaying 15 items.
- (Q197696) (redirect page) (← links)
- A linear algorithm for the group path problem on chordal graphs (Q686257) (← links)
- Efficient reduction for path problems on circular-arc graphs (Q802884) (← links)
- The realization graph of a degree sequence with majorization gap 1 is Hamiltonian (Q1300907) (← links)
- Degree sequences and majorization (Q1322868) (← links)
- Efficient computation of implicit representations of sparse graphs (Q1377648) (← links)
- A correctness certificate for the Stoer-Wagner min-cut algorithm (Q1606951) (← links)
- An efficient algorithm for finding a two-pair, and its applications (Q1814097) (← links)
- A polynomial algorithm for the parity path problem on perfectly orientable graphs (Q1917257) (← links)
- All-pairs min-cut in sparse networks (Q2956696) (← links)
- All-Pairs Min-Cut in Sparse Networks (Q4217302) (← links)
- (Q4525709) (← links)
- Planar spanners and approximate shortest path queries among obstacles in the plane (Q4595512) (← links)
- Realizing Degree Sequences in Parallel (Q4881296) (← links)
- Approximation algorithms for maximum two-dimensional pattern matching (Q5941062) (← links)
