A detachment algorithm for inferring a graph from path frequency

DOI10.1007/s00453-008-9184-0zbMath1172.68049OpenAlexW2077654283MaRDI QIDQ1014796

Hiroshi Nagamochi

Publication date: 29 April 2009

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9184-0

zbMATH Keywords

connectivitymultigraphsgraph inferencedetachment algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items

On computational complexity of graph inference from counting, Inferring a graph from path frequency, Orientations and detachments of graphs with prescribed degrees and connectivity

Cites Work

• Unnamed Item
• Non-separable detachments of graphs
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
• Some Theorems on Detachments Preserving Local-Edge-Connectivity
• Connected Detachments of Graphs and Generalized Euler Trails
• Improved Bounds for Matroid Partition and Intersection Algorithms
• A weighted matroid intersection algorithm
• Matroid intersection algorithms
• Highly edge-connected detachments of graphs and digraphs
• Combinatorial Pattern Matching
• Combinatorial optimization. Theory and algorithms