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...

Celý popis

Podrobná bibliografie

Vydáno v:	Theoretical computer science Ročník 916; s. 70 - 85
Hlavní autor:	Rusu, Irena
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 19.05.2022 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!