Finding Cliques in Directed Weighted Graphs Using Complex Hermitian Adjacency Matrices

2007 ◽  
pp. 83-90 ◽  
Author(s):  
Bettina Hoser ◽  
Thomas Bierhance
Keyword(s):  
Weighted Graphs ◽  
Adjacency Matrices ◽  
Directed Weighted Graphs

On Computing the Diameter of Real-World Directed (Weighted) Graphs

2012 ◽  
pp. 99-110 ◽  
Author(s):  
Pierluigi Crescenzi ◽  
Roberto Grossi ◽  
Leonardo Lanzi ◽  
Andrea Marino
Keyword(s):  
Real World ◽  
Weighted Graphs ◽  
Directed Weighted Graphs

scholarly journals Linear Time Additively Exact Algorithm for Transformation of Chain-Cycle Graphs for Arbitrary Costs of Deletions and Insertions

Mathematics ◽  
2020 ◽  
Vol 8 (11) ◽  
pp. 2001
Author(s):  
Konstantin Gorbunov ◽  
Vassily Lyubetsky
Keyword(s):  
Linear Time ◽  
Exact Algorithm ◽  
Time Algorithm ◽  
Additive Constant ◽  
Weighted Graphs ◽  
Total Cost ◽  
Operation Costs ◽  
Double Cut And Join ◽  
Vertex Degrees ◽  
Directed Weighted Graphs

We propose a novel linear time algorithm which, given any directed weighted graphs a and b with vertex degrees 1 or 2, constructs a sequence of operations transforming a into b. The total cost of operations in this sequence is minimal among all possible ones or differs from the minimum by an additive constant that depends only on operation costs but not on the graphs themselves; this difference is small as compared to the operation costs and is explicitly computed. We assume that the double cut and join operations have identical costs, and costs of the deletion and insertion operations are arbitrary strictly positive rational numbers.

scholarly journals A distance metric between directed weighted graphs

2013 ◽  
Author(s):  
Yunwen Xu ◽  
Srinivasa M. Salapaka ◽  
Carolyn L. Beck
Keyword(s):  
Weighted Graphs ◽  
Distance Metric ◽  
Directed Weighted Graphs
Sign in / Sign up

Export Citation Format

Share Document