Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Sebastian, J.
Claudia Calabrese
Maria Iosifidi
Hao Mao
Dung Le
Peter Malec
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
NEAL E. YOUNG
Author Info
Open Visualization
Name
Affiliation
Papers
NEAL E. YOUNG
University of Maryland Institute for Advanced Computer Studies 20742 College Park MD 20742 College Park MD
6
Collaborators
Citations
PageRank
7
128
10.10
Referers
Referees
References
224
126
81
Search Limit
100
224
Publications (6 rows)
Collaborators (7 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Approximating the Minimum Equivalent Digraph
29
1.80
2002
Designing multi-commodity flow trees
11
0.78
2002
Data collection for the Sloan digital sky survey—a network-flow heuristic
14
2.84
2002
On strongly connected digraphs with bounded cycle length
26
1.72
1996
A network-flow technique for finding low-weight bounded-degree spanning trees
16
1.33
1996
A primal-dual parallel approximation technique applied to weighted set and vertex covers
32
1.64
1993
1