DocumentCode
2315206
Title
A Depth-first Algorithm to Reduce Graphs in Linear Time
Author
Bartha, Miklós ; Krész, Miklós
Author_Institution
Dept. of Comput. Sci., Memorial Univ. of Newfoundland, St. John´´s, NL, Canada
fYear
2009
fDate
26-29 Sept. 2009
Firstpage
273
Lastpage
281
Abstract
A redex in a graph G is a triple r = (u, c, v) of distinct vertices that determine a 2-star. Shrinking r means deleting the center c and merging u with v into one vertex. Reduction of G entails shrinking all of its redexes in a recursive way, and, at the same time, deleting all loops that are created during this process. It is shown that reduction can be implemented in O(m) time, where m is the number of edges in G.
Keywords
graph theory; graphs; tree searching; depth-first algorithm; distinct vertices; graphs; linear time; redex; Automata; Computer science; Computer science education; Gain; Merging; Scientific computing; Solitons; Tree graphs; depth-first trees; graphs and matchings; shrinking edges in graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2009 11th International Symposium on
Conference_Location
Timisoara
Print_ISBN
978-1-4244-5910-0
Electronic_ISBN
978-1-4244-5911-7
Type
conf
DOI
10.1109/SYNASC.2009.48
Filename
5460840
Link To Document