Paper Info
Title
Algorithms for optimal orientations of a unicyclic graph
Abstract
Let (G, R) denote the directed graph obtained from undirected graph G by an acyclic orientation R so that (G, R) contains no directed cycle. We consider acyclic orientations R of a unicyclic graph G which maximizes/minimizes the number of ordered pairs of non-adjacent vertices with directed paths in (G, R). These orientations are referred as optimal orientations. We present algorithms to determine optimal orientations of a unicyclic graph.
Year
DOI
Venue
2004
10.1145/986537.986589
ACM Southeast Regional Conference 2005
Keywords
Field
DocType
acyclic orientation r,unicyclic graph,optimal orientation,undirected graph,non-adjacent vertex,present algorithm,acyclic orientations r,directed graph
Graph power,Transpose graph,Computer science,Cycle graph,Directed graph,Algorithm,Null graph,Voltage graph,Complement graph,Acyclic orientation
Conference
ISBN
Citations 
PageRank 
1-58113-870-9
2
0.46
References 
Authors
2
2
Name
Order
Citations
PageRank
Suk Jai Seo142.59
Ashok T. Amin2172.93