An efficient approach for large scale graph partitioning.
Saved in:
| Title: | An efficient approach for large scale graph partitioning. |
|---|---|
| Authors: | Renzo Zamprogno1, André Amaral1 |
| Source: | Journal of Combinatorial Optimization. May2007, Vol. 13 Issue 4, p289-320. 32p. |
| Database: | Mathematics Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: msf DbLabel: Mathematics Source An: 24725479 AccessLevel: 2 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: An efficient approach for large scale graph partitioning. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Renzo+Zamprogno%22">Renzo Zamprogno</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22André+Amaral%22">André Amaral</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Journal+of+Combinatorial+Optimization%22">Journal of Combinatorial Optimization</searchLink>. May2007, Vol. 13 Issue 4, p289-320. 32p. |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=msf&AN=24725479 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s10878-006-9026-4 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 32 StartPage: 289 Titles: – TitleFull: An efficient approach for large scale graph partitioning. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Renzo Zamprogno – PersonEntity: Name: NameFull: André Amaral IsPartOfRelationships: – BibEntity: Dates: – D: 03 M: 05 Text: May2007 Type: published Y: 2007 Identifiers: – Type: issn-print Value: 13826905 Numbering: – Type: volume Value: 13 – Type: issue Value: 4 Titles: – TitleFull: Journal of Combinatorial Optimization Type: main |
| ResultId | 1 |