More efficient algorithms for searching for several edges in a hypergraph.
Saved in:
| Title: | More efficient algorithms for searching for several edges in a hypergraph. |
|---|---|
| Authors: | Chen, Ting1 (AUTHOR) steafting@sina.com |
| Source: | Indian Journal of Pure & Applied Mathematics. Apr2026, Vol. 57 Issue 2, p425-433. 9p. |
| Database: | Mathematics Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: msf DbLabel: Mathematics Source An: 192480989 AccessLevel: 2 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: More efficient algorithms for searching for several edges in a hypergraph. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Chen%2C+Ting%22">Chen, Ting</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> steafting@sina.com</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Indian+Journal+of+Pure+%26+Applied+Mathematics%22">Indian Journal of Pure & Applied Mathematics</searchLink>. Apr2026, Vol. 57 Issue 2, p425-433. 9p. |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=msf&AN=192480989 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s13226-024-00561-z Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 9 StartPage: 425 Titles: – TitleFull: More efficient algorithms for searching for several edges in a hypergraph. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Chen, Ting IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 04 Text: Apr2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 00195588 Numbering: – Type: volume Value: 57 – Type: issue Value: 2 Titles: – TitleFull: Indian Journal of Pure & Applied Mathematics Type: main |
| ResultId | 1 |