The complexity of counting cuts and of computing the probability that a graph is connected.
Saved in:
| Title: | The complexity of counting cuts and of computing the probability that a graph is connected. |
|---|---|
| Authors: | Provan, J. Scott, Ball, Michael O. |
| Source: | SIAM Journal on Computing; November 1983, Vol. 12, p777-788, 12p |
| Database: | Applied Science & Technology Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: aci DbLabel: Applied Science & Technology Source An: 500021326 AccessLevel: 2 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: The complexity of counting cuts and of computing the probability that a graph is connected. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AU" term="%22Provan%2C+J%2E+Scott%22">Provan, J. Scott</searchLink><br /><searchLink fieldCode="AU" term="%22Ball%2C+Michael+O%2E%22">Ball, Michael O.</searchLink> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22SIAM+Journal+on+Computing%22">SIAM Journal on Computing</searchLink>; November 1983, Vol. 12, p777-788, 12p |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=aci&AN=500021326 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1137/0212053 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 12 StartPage: 777 Titles: – TitleFull: The complexity of counting cuts and of computing the probability that a graph is connected. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Provan, J. Scott – PersonEntity: Name: NameFull: Ball, Michael O. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 11 Text: November 1983 Type: published Y: 1983 Identifiers: – Type: issn-print Value: 00975397 Numbering: – Type: volume Value: 12 Titles: – TitleFull: SIAM Journal on Computing Type: main |
| ResultId | 1 |