Matches in DBpedia 2016-04 for { <http://doi.org/10.1137/0212053> ?p ?o }
Showing triples 1 to 13 of
13
with 100 triples per page.
- 0212053 doi "10.1137/0212053".
- 0212053 first1 "J. Scott".
- 0212053 first2 "Michael O.".
- 0212053 isCitedBy Connectivity_(graph_theory).
- 0212053 issue "4".
- 0212053 journal SIAM_Journal_on_Computing.
- 0212053 last1 "Provan".
- 0212053 last2 "Ball".
- 0212053 mr "721012".
- 0212053 pages "777–788".
- 0212053 title "The complexity of counting cuts and of computing the probability that a graph is connected".
- 0212053 volume "12".
- 0212053 year "1983".