User contributions
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 09:58, 6 November 2016 (diff | hist) . . (+173) . . Complexity of computing the rotor-router action
- 09:57, 6 November 2016 (diff | hist) . . (+376) . . Complexity of computing the rotor-router action
- 09:55, 6 November 2016 (diff | hist) . . (+124) . . N Complexity of computing the rotor-router action (Created page with "What is the complexity of computing the rotor-router action of the Picard group on the spanning in-arborescences of a graph?")
- 09:54, 6 November 2016 (diff | hist) . . (+5) . . m Chip-firing (→Rotor-routing)
- 09:53, 6 November 2016 (diff | hist) . . (+848) . . Chip-firing (→Rotor-routing)
- 18:44, 3 November 2016 (diff | hist) . . (-1) . . m Duality between chip-firing games and graph divisor theory
- 18:43, 3 November 2016 (diff | hist) . . (-117) . . Chip-firing (→Graph divisor theory)
- 18:41, 3 November 2016 (diff | hist) . . (+117) . . Chip-firing (→Graph divisor theory)
- 18:38, 3 November 2016 (diff | hist) . . (-12) . . m Duality between chip-firing games and graph divisor theory
- 18:37, 3 November 2016 (diff | hist) . . (-1) . . m Duality between chip-firing games and graph divisor theory
- 18:36, 3 November 2016 (diff | hist) . . (-3) . . Duality between chip-firing games and graph divisor theory
- 18:35, 3 November 2016 (diff | hist) . . (-1) . . Duality between chip-firing games and graph divisor theory
- 18:33, 3 November 2016 (diff | hist) . . (0) . . m Duality between chip-firing games and graph divisor theory
- 18:30, 3 November 2016 (diff | hist) . . (+1) . . Duality between chip-firing games and graph divisor theory
- 18:30, 3 November 2016 (diff | hist) . . (0) . . Duality between chip-firing games and graph divisor theory
- 18:27, 3 November 2016 (diff | hist) . . (+249) . . m Duality between chip-firing games and graph divisor theory
- 18:25, 3 November 2016 (diff | hist) . . (+1,246) . . N Duality between chip-firing games and graph divisor theory (Created page with "There is a duality between the notion of graph divisor theory and chip-firing, which was discovered by Baker and Norine <>. Let <math>G<math/> be a graph and let <math>K^+...")
- 19:47, 30 October 2016 (diff | hist) . . (+67) . . m Picard group of a graph
- 19:46, 30 October 2016 (diff | hist) . . (0) . . m Picard group of a graph
- 19:45, 30 October 2016 (diff | hist) . . (+1) . . Picard group of a graph
- 19:45, 30 October 2016 (diff | hist) . . (-2) . . Picard group of a graph
- 19:44, 30 October 2016 (diff | hist) . . (+337) . . N Picard group of a graph (Created page with "The picard group of a graph is the free Abelian group of the degree zero divisors factorized by linear equivalence: <math> \Pic^0(G)=\Div^0(G)/Im(L). <math/> === Remarks ===...")
- 19:37, 30 October 2016 (diff | hist) . . (0) . . Chip-firing (→Graph divisor theory)
- 19:37, 30 October 2016 (diff | hist) . . (+17) . . m Chip-firing (→Graph divisor theory)
- 19:32, 30 October 2016 (diff | hist) . . (+1) . . Linear equivalence of graph divisors (→Remarks)
- 19:31, 30 October 2016 (diff | hist) . . (+1) . . Linear equivalence of graph divisors (→Remarks)
- 19:30, 30 October 2016 (diff | hist) . . (+142) . . Linear equivalence of graph divisors
- 19:21, 30 October 2016 (diff | hist) . . (+30) . . Linear equivalence of graph divisors (→References)
- 19:20, 30 October 2016 (diff | hist) . . (+37) . . Linear equivalence of graph divisors
- 20:54, 29 October 2016 (diff | hist) . . (+31) . . Chip-firing (→Rotor-routing)
- 20:53, 29 October 2016 (diff | hist) . . (+2) . . Chip-firing (→Reachability problem)
- 20:51, 29 October 2016 (diff | hist) . . (+160) . . Chip-firing (→Reachability problem)
- 20:49, 29 October 2016 (diff | hist) . . (-2) . . Chip-firing (→Graph divisor theory)
- 20:43, 29 October 2016 (diff | hist) . . (+8) . . m Complexity of the halting problem for simple digraphs
- 20:42, 29 October 2016 (diff | hist) . . (-52) . . Complexity of the halting problem for simple digraphs
- 20:36, 29 October 2016 (diff | hist) . . (+2) . . Complexity of the halting problem for simple digraphs (→References)
- 20:35, 29 October 2016 (diff | hist) . . (+50) . . Complexity of the halting problem for Eulerian multigraphs
- 20:34, 29 October 2016 (diff | hist) . . (+62) . . Complexity of the halting problem for Eulerian multigraphs
- 20:33, 29 October 2016 (diff | hist) . . (-59) . . Complexity of the halting problem for Eulerian multigraphs
- 20:25, 29 October 2016 (diff | hist) . . (+210) . . Complexity of the chip-firing reachability problem for general digraphs (→References)
- 20:24, 29 October 2016 (diff | hist) . . (+150) . . Complexity of the chip-firing reachability problem for general digraphs (→Remarks)
- 20:18, 29 October 2016 (diff | hist) . . (+7) . . Complexity of the chip-firing reachability problem for general digraphs
- 17:51, 27 October 2016 (diff | hist) . . (+6) . . Rank of graph divisors
- 17:49, 27 October 2016 (diff | hist) . . (+39) . . Rank of graph divisors
- 17:46, 27 October 2016 (diff | hist) . . (-106) . . Rank of graph divisors
- 09:24, 26 October 2016 (diff | hist) . . (+8) . . m Chip-firing
- 09:20, 26 October 2016 (diff | hist) . . (+1) . . Complexity of the chip-firing reachability problem for general digraphs
- 09:18, 26 October 2016 (diff | hist) . . (+216) . . Complexity of the chip-firing reachability problem for general digraphs
- 09:18, 26 October 2016 (diff | hist) . . (+309) . . N Complexity of the chip-firing reachability problem for general digraphs (Created page with "'''Open question:''' <onlyinclude> Is the chip-firing reachability problem co-'''NP'''-hard for general digraphs? </onlyinclude> ==Remarks== The chip-firing reachability pro...")
- 09:14, 26 October 2016 (diff | hist) . . (+374) . . m Chip-firing (→Reachability)
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
