A polynomial-time reduction from the multi-graph isomorphism problem to additive code equivalence
Simeon Ball, James Edward Dixon
Journal
- ISSN / E-ISSN
- — / 2664-2557
- DOI
- 10.47443/dml.2021.0097 ↗
- Volume · Issue · Pages
- 8 · — · 66-68
- Publisher
- Shahin Digital Publisher
- Article URL
- https://doi.org/10.47443/dml.2021.0097 ↗
- Article details
- Unverified
Publication date (each date has its type and source)
02 Dec 2021
OpenAlex publication date · source: OpenAlex
| Type | Date | Source |
|---|---|---|
| OpenAlex publication date | 02 Dec 2021 | OpenAlex |
Keywords (as given): Graph isomorphism; Equivalence (formal languages); Isomorphism (crystallography); Mathematics; Reduction (mathematics); Discrete mathematics; Graph; Combinatorics; Line graph; Chemistry
HEC Status at Publication Not the journal's current status
HEC Status at PublicationNot conclusive
Historical status could not be conclusively determined.
- HEC status cannot be determined for this date: no HEC list is recorded as in effect on it.
Best available information, not a definitive status: HEC status cannot be determined for this date: no HEC list is recorded as in effect on it.
- Journal
- Discrete Mathematics Letters
- Publication date used
- 02 Dec 2021 (OpenAlex publication date)
- Applicable HEC period
- None recorded for this date
- Category
- —
- Recognition status
- Unknown (NO_PERIOD_FOR_DATE)
- Source
- —
- Verification status
- Not available
Informational only. HJRS.com.pk is independent and is not an official HEC website: confirm with the source document.