ILIGRA: an efficient inverse line graph algorithm

DOI10.1007/s10852-014-9251-2zbMath1347.05239OpenAlexW2106452164MaRDI QIDQ894425

Stojan Trajanovski, Dajie Liu, Piet Van Mieghem

Publication date: 1 December 2015

Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)

Full work available at URL: http://resolver.tudelft.nl/uuid:aabe6d90-0681-4139-9a6d-201e70843ead

zbMATH Keywords

graph algorithmline graphroot graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)

Related Items (6)

Degree distribution and assortativity in line graphs of complex networks ⋮ Biclique graphs of interval bigraphs ⋮ New results and open problems in line graphs ⋮ Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ ILIGRA

Uses Software

• LEDA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clustering in random line graphs
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• Emergence of Scaling in Random Networks
• An efficient reconstruction of a graph from its line graph in parallel
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• Congruent Graphs and the Connectivity of Graphs
• The interchange graph of a finite graph

This page was built for publication: ILIGRA: an efficient inverse line graph algorithm