A detachment algorithm for inferring a graph from path frequency
type: Item
instance of: scholarly article
title: A detachment algorithm for inferring a graph from path frequency
zbMATH Open document ID: 1172.68049
author: Hiroshi Nagamochi
published in: Algorithmica
publication date: 2009-04-29T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5549517
zbMATH Keywords: connectivity
zbMATH Keywords: detachment algorithm
zbMATH Keywords: graph inference
zbMATH Keywords: multigraphs
MaRDI profile type: Publication
full work available at URL: s00453-008-9184-0
OpenAlex ID: W2077654283
cites work: Combinatorial Pattern Matching
cites work: Highly edge-connected detachments of graphs and digraphs
cites work: An introduction to support vector machines and other kernel-based learning methods.
cites work: Improved Bounds for Matroid Partition and Intersection Algorithms
cites work: A weighted matroid intersection algorithm
cites work: Some Theorems on Detachments Preserving Local-Edge-Connectivity
cites work: Non-separable detachments of graphs
cites work: Combinatorial optimization. Theory and algorithms
cites work: Matroid intersection algorithms
cites work: Connected Detachments of Graphs and Generalized Euler Trails
cites work: Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
DOI: 10.1007/S00453-008-9184-0
description: scientific article; zbMATH DE number 5549517