Hamiltonian problems in directed graphs with simple row patterns

We define a row pattern of a matrix as a model (or a condition) to be satisfied by each row of the matrix, independently of the other rows. When applied to adjacency matrices of digraphs, a row pattern allows to define a class of digraphs characterized by a local condition on the out-neighborhood of...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 916; pp. 70 - 85
Main Author:	Rusu, Irena
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 19.05.2022 Elsevier
Subjects:	Complexity of algorithms Computational Complexity Computer Science Consecutive ones property Data Structures and Algorithms Hamiltonian problems Linear ordering of the vertices Hamiltonian problems Consecutive ones property Complexity of algorithms Linear ordering of the vertices
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!