ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
6
views
0
references
Top references
cited by
2
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,095
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
A matroid approach to finding edge connectivity and packing arborescences
Author(s):
H Gabow
Publication date:
1991
Read this article at
ScienceOpen
Publisher
Further versions
Bookmark
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
AI & Robotics
Author and article information
Journal
DOI::
10.1145/103418.103436
ScienceOpen disciplines:
Data structures & Algorithms
,
Computer science
,
Networking & Internet architecture
Data availability:
ScienceOpen disciplines:
Data structures & Algorithms
,
Computer science
,
Networking & Internet architecture
Comments
Comment on this article
Sign in to comment
Related Documents Log
scite_
Similar content
2,095
ARBORESCENCES
Authors:
A strongly polynomial algorithm for the inverse shortest arborescence problem
Authors:
Hu Zhiquan
,
Liu Zhenhong
Development of an ecotoxicological model in an arborescent river network: an attempt with a brown trout population
Authors:
Arnaud Chaumot
,
Sandrine CHARLES
,
P AUGER
…
See all similar
Cited by
2
Local Flow Partitioning for Faster Edge Connectivity
Authors:
Monika Henzinger
,
Satish K Rao
,
Di Wang
Distributed Minimum Cut Approximation
Authors:
Fabian Kuhn
,
Mohsen Ghaffari
See all cited by