An algorithm for finding all the k -components of a digraph.
Saved in:
| Title: | An algorithm for finding all the k -components of a digraph. |
|---|---|
| Authors: | Makino, Seishi1 |
| Source: | International Journal of Computer Mathematics. Jan1988, Vol. 24 Issue 3/4, p213-221. 9p. |
| Database: | Mathematics Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: msf DbLabel: Mathematics Source An: 75662280 AccessLevel: 2 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: An algorithm for finding all the k -components of a digraph. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Makino%2C+Seishi%22">Makino, Seishi</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Computer+Mathematics%22">International Journal of Computer Mathematics</searchLink>. Jan1988, Vol. 24 Issue 3/4, p213-221. 9p. |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=msf&AN=75662280 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1080/00207168808803645 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 9 StartPage: 213 Titles: – TitleFull: An algorithm for finding all the k -components of a digraph. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Makino, Seishi IsPartOfRelationships: – BibEntity: Dates: – D: 05 M: 01 Text: Jan1988 Type: published Y: 1988 Identifiers: – Type: issn-print Value: 00207160 Numbering: – Type: volume Value: 24 – Type: issue Value: 3/4 Titles: – TitleFull: International Journal of Computer Mathematics Type: main |
| ResultId | 1 |