ILIGRA: an efficient inverse line graph algorithm

DOI10.1007/S10852-014-9251-2MaRDI QIDQ894425zbMATH OpenOpenAlexFDO

Authors Dajie Liu, Stojan Trajanovski, 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

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

Recommendations

• An efficient reconstruction of a graph from its line graph in parallel
• scientific article; zbMATH DE number 3974289
• scientific article; zbMATH DE number 3987319
• Linear-time graph algorithms in GP 2
• scientific article; zbMATH DE number 176590
• An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing
• Graph Drawing
• An Almost Linear-Time Algorithm for Graph Realization
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs
• An Incremental Linear-Time Algorithm for Recognizing Interval Graphs

Cites work

• scientific article; zbMATH DE number 5838442 (Why is no real title available?)
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 4214062 (Why is no real title available?)
• scientific article; zbMATH DE number 193053 (Why is no real title available?)
• scientific article; zbMATH DE number 1368469 (Why is no real title available?)
• scientific article; zbMATH DE number 2117218 (Why is no real title available?)
• scientific article; zbMATH DE number 3102314 (Why is no real title available?)
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• An efficient reconstruction of a graph from its line graph in parallel
• Clustering in random line graphs
• Congruent Graphs and the Connectivity of Graphs
• Emergence of Scaling in Random Networks
• Graph spectra for complex networks
• Random graphs.
• The interchange graph of a finite graph

Cited in

(9)

• Graphs with least eigenvalue \(-2\): ten years on
• An efficient reconstruction of a graph from its line graph in parallel
• Finding the root graph through minimum edge deletion
• ILIGRA
• New results and open problems in line graphs
• Biclique graphs of interval bigraphs
• Degree distribution and assortativity in line graphs of complex networks
• A dynamic algorithm for line graph recognition
• Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network

Describes a project that uses

Uses Software

• LEDA

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894425)