Back to Results
First PageMeta Content
Combinatorics / Matroid / Bicircular matroid / Greedoid / Pseudoforest / Reachability / Duality / Graph / St-connectivity / Mathematics / Matroid theory / Graph theory


Complexity of Testing Reachability in Matroids
Add to Reading List

Document Date: 2014-07-14 14:10:19

Open Document

File Size: 387,36 KB

Share Result on Facebook

City

UFA / /

Company

Creative Commons / Matroids B.V. / /

Country

India / Sudan / /

Currency

pence / /

/

Facility

Indian Institute of Technology Madras / /

IndustryTerm

careful applications / graph reachability algorithm / above algorithm / connectivity testing algorithm / log-space algorithm / direct algorithm / /

Organization

Indian Institute of Technology Madras / Department of Computer Science and Engineering / /

Product

Corollary 3.2 / /

ProgrammingLanguage

R / /

ProvinceOrState

New Foundland and Labrador / /

Technology

log-space algorithm / above algorithm / connectivity testing algorithm / undirected graph reachability algorithm / direct algorithm / /

URL

http /

SocialTag