A detachment algorithm for inferring a graph from path frequency

DOI10.1007/S00453-008-9184-0MaRDI QIDQ1014796zbMATH OpenOpenAlexFDO

Authors 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

connectivitydetachment algorithmgraph inferencemultigraphs

Mathematics Subject Classification ID

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

Recommendations

• A Detachment Algorithm for Inferring a Graph from Path Frequency
• Inferring a graph from path frequency
• Combinatorial Pattern Matching
• On computational complexity of graph inference from counting
• Mathematical Foundations of Computer Science 2003

Cites work

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

Cited in

(5)

• Orientations and detachments of graphs with prescribed degrees and connectivity
• On computational complexity of graph inference from counting
• A Detachment Algorithm for Inferring a Graph from Path Frequency
• Inferring a graph from path frequency
• Combinatorial Pattern Matching

This page was built for publication: A detachment algorithm for inferring a graph from path frequency

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