A dynamic algorithm for line graph recognition

DOI10.1007/3-540-60618-1_64OpenAlexW1536407537WikidataQ56388825 ScholiaQ56388825MaRDI QIDQ6122210

Unnamed Author, Klaus Simon

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60618-1_64

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

A Polynomial Kernel for Line Graph Deletion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• Zu einem Isomorphiesatz von H. Whitney für Graphen
• Improved data structures for fully dynamic biconnectivity
• 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
• Separator based sparsification for dynamic planar graph algorithms
• The interchange graph of a finite graph

This page was built for publication: A dynamic algorithm for line graph recognition