Euler tour technique

#	Item
1	A novel approach to propagating distrust Christian Borgs1 , Jennifer Chayes1 , Adam Tauman Kalai1 , Azarakhsh Malekian2 , and Moshe Tennenholtz3 1 2 Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2010-10-31 20:18:18 Network flow Flow network Operations research Graph Bellman–Ford algorithm Euler tour technique Graph theory Mathematics Combinatorics
2	Solutions to Homework Five CSE[removed]Finding the sources of a directed graph. We will keep an array in[u] which holds the indegree (number of incoming edges) of each node. For a Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2014-11-01 14:36:34 Graph Adjacency list Adjacency matrix Euler tour technique Graph theory Mathematics Directed graph
3	PDF Document Add to Reading List Source URL: www.mpi-inf.mpg.de Language: English - Date: 2010-12-09 11:09:54 Spanning tree Minimum spanning tree Eulerian path Biconnected component Euler tour technique Connected component Matching Uzi Vishkin Graph coloring Graph theory Theoretical computer science Mathematics
4	PDF Document Add to Reading List Source URL: www.cs.jhu.edu Language: English - Date: 2003-11-13 20:20:18 Theoretical computer science Koorde Chord FO Bridge Distributed hash table Euler tour technique Distributed data storage Computing Graph theory