Solution of the minimal cut problem in a biconnected directed graph by using a branch-and-bound algorithm.
Saved in:
| Title: | Solution of the minimal cut problem in a biconnected directed graph by using a branch-and-bound algorithm. |
|---|---|
| Authors: | Burkov, V. N., Groppen, V. O. |
| Source: | Automation & Remote Control; September 1974, Vol. 35, p1468-2, 8p |
| Database: | Applied Science & Technology Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: aci DbLabel: Applied Science & Technology Source An: 516755224 AccessLevel: 2 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Solution of the minimal cut problem in a biconnected directed graph by using a branch-and-bound algorithm. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AU" term="%22Burkov%2C+V%2E+N%2E%22">Burkov, V. N.</searchLink><br /><searchLink fieldCode="AU" term="%22Groppen%2C+V%2E+O%2E%22">Groppen, V. O.</searchLink> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Automation+%26+Remote+Control%22">Automation & Remote Control</searchLink>; September 1974, Vol. 35, p1468-2, 8p |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=aci&AN=516755224 |
| RecordInfo | BibRecord: BibEntity: Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 8 StartPage: 1468 Titles: – TitleFull: Solution of the minimal cut problem in a biconnected directed graph by using a branch-and-bound algorithm. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Burkov, V. N. – PersonEntity: Name: NameFull: Groppen, V. O. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 09 Text: September 1974 Type: published Y: 1974 Identifiers: – Type: issn-print Value: 00051179 Numbering: – Type: volume Value: 35 Titles: – TitleFull: Automation & Remote Control Type: main |
| ResultId | 1 |