Constructing an indeterminate string from its associated graph

DOI10.1016/j.tcs.2017.02.016zbMath1387.68309OpenAlexW2592557380MaRDI QIDQ1698711

Joel Helling, Michael Soltys, W. F. Smyth, Patrick J. Ryan

Publication date: 16 February 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10211.3/191875

zbMATH Keywords

cliquesstring algorithmsgraph labelingindeterminate strings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Algorithms on strings (68W32)

Related Items (4)

A new approach to regular \& indeterminate strings ⋮ An improved upper bound and algorithm for clique covers ⋮ Large-scale clique cover of real-world networks ⋮ A formal framework for stringology

Cites Work

• Unnamed Item
• Unnamed Item
• Indeterminate strings, prefix arrays \& undirected graphs
• Applications of edge coverings by cliques
• Fast pattern-matching on indeterminate strings
• Inferring an indeterminate string from a prefix graph
• RECONSTRUCTING A SUFFIX ARRAY
• AN ADAPTIVE HYBRID PATTERN-MATCHING ALGORITHM ON INDETERMINATE STRINGS
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• REVERSE ENGINEERING PREFIX TABLES
• Mathematical Foundations of Computer Science 2003
• The Representation of a Graph by Set Intersections
• Sur deux propriétés des classes d'ensembles

This page was built for publication: Constructing an indeterminate string from its associated graph