Computation and Communication Efficient Graph Processing with Distributed Immutable View Rong Chen†, Xin Ding†, Peng Wang†, Haibo Chen†, Binyu Zang†, Haibing Guan§ Shanghai Key Laboratory of Scalable Computing

Source URL: ipads.se.sjtu.edu.cn

• Graph connectivity
• Graph theory
• Vertex
• Connected component
• RochaThatte cycle detection algorithm
• K-connectivity certificate

Connecting Obstacles in Vertex-Disjoint Paths Marwan Al-Jubeh∗ Gill Barequet†∗ Mashhood Ishaque∗

Source URL: www.eecs.tufts.edu

• Graph theory
• Graph connectivity
• Planar graphs
• Graph operations
• Bipartite graphs
• Tree
• Neighbourhood
• Line graph
• Path
• Connectivity
• Graph
• K-edge-connected graph

Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Dominating set
• Independent set
• Vertex cover
• Connected dominating set
• Set cover problem
• Line graph
• Metric k-center
• Domatic number

PDF Document

Source URL: fpt.akt.tu-berlin.de

• Graph theory
• NP-complete problems
• Graph connectivity
• Graph operations
• Graph coloring
• Degeneracy
• Tree
• Neighbourhood
• Clique
• K-edge-connected graph
• Vertex cover
• Degree

Handout on vertex separators and low tree-width k-partition January 12 and 19, 2012 Given a graph G(V, E) and a set of vertices S ⊂ V , an S-flap is the set of vertices in a connected component of the graph induced on

Source URL: www.wisdom.weizmann.ac.il

Reachability in K3,3-free and K5-free Graphs is in Unambiguous Logspace

Source URL: cjtcs.cs.uchicago.edu

• Connected component
• SPQR tree
• Biconnected graph
• Directed acyclic graph
• Series-parallel graph
• Reachability
• Tree decomposition
• Tree
• K-vertex-connected graph
• Graph theory
• Graph connectivity
• Biconnected component