- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
The Power Word Problem in Graph Products ; volume:68 ; number:3 ; day:7 ; month:5 ; year:2024 ; pages:403-464 ; date:6.2024
Theory of computing systems ; 68, Heft 3 (7.5.2024), 403-464, 6.2024
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00224-024-10173-z
- URN
-
urn:nbn:de:101:1-2409122059314.580938647191
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:32 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Lohrey, Markus
- Stober, Florian
- Weiß, Armin
- SpringerLink (Online service)
Other Objects (12)
The power word problem in graph groups
Word-representable graphs from a word’s perspective
Dia word articulation / distance graph
Distinguishing Sierpiński products of graphs
Prosodic scoring of word hypotheses graphs
Word power for Germans, Key.
Word power for Germans, Hauptbd.
Word power for Germans, Hauptbd.
Decision problems over infinite graphs : higher-order pushdown systems and synchronized products
Chain Graph Reduction Into Power Chain Graphs
The power of algorithmic approaches to the graph isomorphism problem
Peg Solitaire on Cartesian Products of Graphs
The power word problem in graph groups
Word-representable graphs from a word’s perspective
Dia word articulation / distance graph
Distinguishing Sierpiński products of graphs
Prosodic scoring of word hypotheses graphs
Word power for Germans, Key.
Word power for Germans, Hauptbd.
Word power for Germans, Hauptbd.
Decision problems over infinite graphs : higher-order pushdown systems and synchronized products
Chain Graph Reduction Into Power Chain Graphs
The power of algorithmic approaches to the graph isomorphism problem
Peg Solitaire on Cartesian Products of Graphs
The power word problem in graph groups
Word-representable graphs from a word’s perspective
Dia word articulation / distance graph
Distinguishing Sierpiński products of graphs
Prosodic scoring of word hypotheses graphs
Word power for Germans, Key.
Word power for Germans, Hauptbd.
Word power for Germans, Hauptbd.
Decision problems over infinite graphs : higher-order pushdown systems and synchronized products
Chain Graph Reduction Into Power Chain Graphs
The power of algorithmic approaches to the graph isomorphism problem