Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10972| Title: | Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems |
| Institution and School/Department of submitter: | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής |
| Keywords: | dominators,flowgraphs,pointer machine,random-access machine,set union,path compression,nearest common ancestors,minimum spanning trees,interval analysis,component tree,data structures,analysis of algorithms,minimum spanning-trees,nearest common ancestors,disjoint set union,dependence graph,shortest paths,dynamic trees,verification,find,compression,bottlenecks |
| URI: | https://olympias.lib.uoi.gr/jspui/handle/123456789/10972 |
| ISSN: | 0097-5397 |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| georgiadis-2008-Linear-Time Pointer-Machine Algorithms for Path-Evaluation.pdf | 364.56 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License
