Graph Inclusion and Matching Algorithms for Programs Manipulating Singly linked Heaps
Programs that manipulate heaps such as singlylinked lists, doublylinked lists, skiplists, and treesare ubiquitous, and hence ensuring their correctness is of utmost importance. Analysing correctness properties for such programs is not trivial since they induce dynamic data structures, le...
Main Author: | Muhsin H. Atto |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zakho
2021-03-01
|
Series: | Science Journal of University of Zakho |
Subjects: | |
Online Access: | http://sjuoz.uoz.edu.krd/index.php/sjuoz/article/view/778 |
Similar Items
-
Algorithms for matching partially labelled sequence graphs
by: William R. Taylor
Published: (2017-09-01) -
Multiplex graph matching matched filters
by: Konstantinos Pantazis, et al.
Published: (2022-05-01) -
Efficient maximum matching algorithms for trapezoid graphs
by: Phan-Thuan Do, et al.
Published: (2017-04-01) -
The phantom alignment strength conjecture: practical use of graph matching alignment strength to indicate a meaningful graph match
by: Donniell E. Fishkind, et al.
Published: (2021-08-01) -
Matching Preclusion of the Generalized Petersen Graph
by: Ajay Arora, et al.
Published: (2019-05-01)