- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
1 Online-Ressource.
- Sprache
-
Englisch
- Erschienen in
-
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
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00224-024-10173-z
- URN
-
urn:nbn:de:101:1-2409122059314.580938647191
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:32 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Lohrey, Markus
- Stober, Florian
- Weiß, Armin
- SpringerLink (Online service)
Ähnliche Objekte (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