Graphs capturing alternations in words

Magnus Halldorsson; Sergey Kitaev; Artem Pyatkin

doi:10.1007/978-3-642-14455-4_41

Graphs capturing alternations in words

Magnus Halldorsson, Sergey Kitaev, Artem Pyatkin

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution book

16 Citations (Scopus)

Abstract

A graph G = (V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x, y) ∈ E for each x ≠ y. If W is k-uniform (each letter of W occurs exactly k times in it) then G is called k-representable. A graph is representable if and only if it is k-representable for some k [1].

Original language	English
Title of host publication	Developments in Language Theory
Subtitle of host publication	14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010. Proceedings
Editors	Yuan Gao, Hanlin Lu, Shinnosuke Seki, Sheng Yu
Pages	436-437
Number of pages	2
DOIs	https://doi.org/10.1007/978-3-642-14455-4_41
Publication status	Published - 2010
Event	14th Conference on Dvelopments in Language Theory - London, Ontario, Canada Duration: 17 Aug 2010 → 20 Aug 2010

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	6224
ISSN (Print)	0302-9743

Conference

Conference	14th Conference on Dvelopments in Language Theory
Country/Territory	Canada
City	London, Ontario
Period	17/08/10 → 20/08/10

Keywords

algorithm analysis
graphs
word patterns

Access to Document

10.1007/978-3-642-14455-4_41

Cite this

@inproceedings{b16608e181314f368e0801b01c48cbf7,

title = "Graphs capturing alternations in words",

abstract = "A graph G = (V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x, y) ∈ E for each x ≠ y. If W is k-uniform (each letter of W occurs exactly k times in it) then G is called k-representable. A graph is representable if and only if it is k-representable for some k [1].",

keywords = "algorithm analysis, graphs, word patterns",

author = "Magnus Halldorsson and Sergey Kitaev and Artem Pyatkin",

year = "2010",

doi = "10.1007/978-3-642-14455-4_41",

language = "English",

isbn = "978-3-642-14454-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "436--437",

editor = "Yuan Gao and Hanlin Lu and Shinnosuke Seki and Sheng Yu",

booktitle = "Developments in Language Theory",

note = "14th Conference on Dvelopments in Language Theory ; Conference date: 17-08-2010 Through 20-08-2010",

}

Halldorsson, M, Kitaev, S & Pyatkin, A 2010, Graphs capturing alternations in words. in Y Gao, H Lu, S Seki & S Yu (eds), Developments in Language Theory: 14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010. Proceedings. Lecture Notes in Computer Science, vol. 6224, pp. 436-437, 14th Conference on Dvelopments in Language Theory, London, Ontario, Canada, 17/08/10. https://doi.org/10.1007/978-3-642-14455-4_41

Graphs capturing alternations in words. / Halldorsson, Magnus; Kitaev, Sergey; Pyatkin, Artem.

Developments in Language Theory: 14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010. Proceedings. ed. / Yuan Gao; Hanlin Lu; Shinnosuke Seki; Sheng Yu. 2010. p. 436-437 (Lecture Notes in Computer Science; Vol. 6224).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution book

TY - GEN

T1 - Graphs capturing alternations in words

AU - Halldorsson, Magnus

AU - Kitaev, Sergey

AU - Pyatkin, Artem

PY - 2010

Y1 - 2010

N2 - A graph G = (V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x, y) ∈ E for each x ≠ y. If W is k-uniform (each letter of W occurs exactly k times in it) then G is called k-representable. A graph is representable if and only if it is k-representable for some k [1].

AB - A graph G = (V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x, y) ∈ E for each x ≠ y. If W is k-uniform (each letter of W occurs exactly k times in it) then G is called k-representable. A graph is representable if and only if it is k-representable for some k [1].

KW - algorithm analysis

KW - graphs

KW - word patterns

UR - https://personal.cis.strath.ac.uk/sergey.kitaev/index_files/Papers/alt2p-final.pdf

U2 - 10.1007/978-3-642-14455-4_41

DO - 10.1007/978-3-642-14455-4_41

M3 - Conference contribution book

SN - 978-3-642-14454-7

T3 - Lecture Notes in Computer Science

SP - 436

EP - 437

BT - Developments in Language Theory

A2 - Gao, Yuan

A2 - Lu, Hanlin

A2 - Seki, Shinnosuke

A2 - Yu, Sheng

T2 - 14th Conference on Dvelopments in Language Theory

Y2 - 17 August 2010 through 20 August 2010

ER -

Graphs capturing alternations in words

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this