Instruct: Given a paper title, retrieve paper titles that are cited by the given paper
Query: Finding Dominators via Disjoint Set Union
Dominator Tree Certification and Independent Spanning Trees
approximation algorithm for minimum weight connected m - fold dominating set .
BFS and Coloring-Based Parallel Algorithms for Strongly Connected Components and Related Problems
The Maximum Disjoint Set of Boundary Rectangles
A new parallel algorithm for connected components in dynamic graphs
Partitioning graphs to speedup Dijkstra's algorithm
A simple parallel algorithm for the maximal independent set problem
Computing strongly connected components in a linear number of symbolic steps
Domination in a graph with a 2-factor
Transitive closure algorithms based on graph traversal
A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components
A scalable, parallel algorithm for maximal clique enumeration
Join-Graph Propagation Algorithms
Algorithms for connected set cover problem and fault-tolerant connected set cover problem
Backtrack search algorithms and the maximal common subgraph problem
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
Finding Overlapping Communities Using Disjoint Community Detection Algorithms
A Simple Algorithm for Subgraph Queries in Big Graphs.
Finding Two Disjoint Simple Paths on Two Sets of Points is NP-Complete
Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
Verification of Periodically Controlled Hybrid Systems: Application to an Autonomous Vehicle
Managing the Next Wave of Enterprise Systems: Leveraging Lessons from ERP
From Concepts to Curricula : Content Exploration , Generation , and Evaluation
Succinate is an inflammatory signal that induces IL-1β through HIF-1α
A simple, fast dominance algorithm