Constructing an indeterminate string from its associated graph
type: Item
instance of: scholarly article
title: Constructing an indeterminate string from its associated graph
zbMATH Open document ID: 1387.68309
author: Joel Helling
author: W. F. Smyth
author: Michael Soltys
author: Patrick J. Ryan
published in: Theoretical Computer Science
publication date: 2018-02-16T00:00:00Z
full work available at URL: http://hdl.handle.net/10211.3/191875
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6839800
zbMATH Keywords: string algorithms
zbMATH Keywords: indeterminate strings
zbMATH Keywords: cliques
zbMATH Keywords: graph labeling
MaRDI profile type: Publication
OpenAlex ID: W2592557380
cites work: Inferring an indeterminate string from a prefix graph
cites work: Mathematical Foundations of Computer Science 2003
cites work: Indeterminate strings, prefix arrays \& undirected graphs
cites work: REVERSE ENGINEERING PREFIX TABLES
cites work: The Representation of a Graph by Set Intersections
cites work: Q4795855
cites work: RECONSTRUCTING A SUFFIX ARRAY
cites work: Q4198056
cites work: Fast pattern-matching on indeterminate strings
cites work: Covering edges by cliques with regard to keyword conflicts and intersection graphs
cites work: Applications of edge coverings by cliques
cites work: AN ADAPTIVE HYBRID PATTERN-MATCHING ALGORITHM ON INDETERMINATE STRINGS
cites work: Sur deux propriétés des classes d'ensembles
DOI: 10.1016/J.TCS.2017.02.016
description: scientific article; zbMATH DE number 6839800