Incrementally Finding the Vertices Absent from the Maximum Independent Sets
- 9 May 2021
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A Neural Network Based Conflict-Graph Construction Approach for Ultra-Dense NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2018
- Computing A Near-Maximum Independent Set in Linear Time by Reducing-PeelingPublished by Association for Computing Machinery (ACM) ,2017
- Next Generation 5G Wireless Networks: A Comprehensive SurveyIEEE Communications Surveys & Tutorials, 2016
- Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex coverTheoretical Computer Science, 2016
- The maximum clique enumeration problem: algorithms, applications, and implementationsBMC Bioinformatics, 2012
- A maximum independent set approach for collusion detection in voting poolsJournal of Parallel and Distributed Computing, 2011
- A measure & conquer approach for the analysis of exact algorithmsJournal of the ACM, 2009
- Mining market data: A network approachComputers & Operations Research, 2006
- Enumerating maximal independent sets with applications to graph colouringOperations Research Letters, 2004
- The webgraph framework IPublished by Association for Computing Machinery (ACM) ,2004