Export Citations
2 Results for: Keyword: Large sparse graphs
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Searched The ACM Guide to Computing Literature (3,797,854 records)|Limit your search to The ACM Full-Text Collection (768,073 records)
Select All
- articleJuly 2019
GraphCombEx: a software tool for exploration of combinatorial optimisation properties of large graphs
Soft Computing - A Fusion of Foundations, Methodologies and Applications (SOFC), Volume 23, Issue 14Pages 5715–5724https://doi.org/10.1007/s00500-018-3230-xWe present a prototype of a software tool for exploration of multiple combinatorial optimisation problems in large real-world and synthetic complex networks. Our tool, called GraphCombEx (an acronym of Graph Combinatorial Explorer), provides a unified ...
- ArticleDecember 2016
Local Search for Maximum Vertex Weight Clique on Large Sparse Graphs with Efficient Data Structures
AI 2016: Advances in Artificial IntelligencePages 255–267https://doi.org/10.1007/978-3-319-50127-7_21AbstractThe Maximum Vertex Weight Clique (MVWC) problem is a generalization of the Maximum Clique problem, which exists in many real-world applications. However, it is NP-hard and also very difficult to approximate. In this paper we developed a local ...