A distributed and asynchronous approach for optimizing weighted graph matchings in wireless network services
- 10 October 2018
- journal article
- research article
- Published by Elsevier in Expert Systems with Applications
- Vol. 119, 73-89
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Supporting sketch-based retrieval from a library of reusable behavioursExpert Systems with Applications, 2013
- Distributed Approximate MatchingSIAM Journal on Computing, 2009
- A fast distributed approximation algorithm for minimum spanning treesDistributed Computing, 2007
- Protein function prediction via graph kernelsBioinformatics, 2005
- THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITIONInternational Journal of Pattern Recognition and Artificial Intelligence, 2004
- Random geometric graphsPhysical Review E, 2002
- Quality matching and local improvement for multilevel graph-partitioningParallel Computing, 2000
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular GraphsSIAM Journal on Scientific Computing, 1998
- A fast and simple randomized parallel algorithm for maximal matchingInformation Processing Letters, 1986
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965