Auto-approximation of graph computing
Authors:
Open Access
- 1 October 2014
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 7 (14) , 1833-1844
Abstract
No abstract availableThis publication has 34 references indexed in Scilit:
- Fast and Scalable, Lock-Free k-FIFO QueuesLecture Notes in Computer Science, 2013
- A few useful things to know about machine learningCommunications of the ACM, 2012
- Continuity and robustness of programsCommunications of the ACM, 2012
- gbase: an efficient analysis platform for large graphsThe VLDB Journal, 2012
- Power-Law Distributions in Empirical DataSIAM Review, 2009
- Probabilistic system-on-a-chip architecturesACM Transactions on Design Automation of Electronic Systems, 2007
- Adaptive Query ProcessingFoundations and Trends® in Databases, 2007
- Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and HypergraphsSIAM Journal on Computing, 2002
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974
- Classes of recursively enumerable sets and their decision problemsTransactions of the American Mathematical Society, 1953