Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper.
Query: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments
The worst-case time complexity for generating all maximal cliques and computational experiments
Fast local search for the maximum independent set problem
a fast and provable method for estimating clique counts using turan ' s theorem .
A simple parallel algorithm for the maximal independent set problem
Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques
A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem
A neural network model for finding a near-maximum clique
Finding maximal cliques in massive networks
Approximations For The Maximum Acyclic Subgraph Problem
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
Linear time algorithm for computing a small biclique in graphs without long induced paths
Efficient algorithms for finding maximum matching in graphs
A tutorial on branch and cut algorithms for the maximum stable set problem
Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting
Approximating maximum independent set in bounded degree graphs
An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
Small Maximal Independent Sets and Faster Exact Graph Coloring
Algorithms column: the vertex cover problem
FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME*
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
Risk Management, Capital Structure and Capital Budgeting in Financial Institutions
The Maximum Clique Problem
The Mixture of Textrank and Lexrank Techniques of Single Document Automatic Summarization Research in Tibetan
Genotyping by sequencing for genomic prediction in a soybean breeding population
Power System Reliability Evaluation With SCADA Cybersecurity Considerations