Eulerian path - PDFSEARCH.IO - Document Search Engine

Eulerian path
Results: 103

#	Item
1	How to apply de Bruijn graphs to genome assembly Add to Reading List Source URL: www.nature.com Language: English - Date: 2012-01-20 11:24:28 Graph theory Mathematics Bioinformatics NP-complete problems Computational biology DNA sequencing K-mer Velvet assembler Eulerian path Hamiltonian path Degree Seven Bridges of Knigsberg
2	I/O-Efficient Algorithms for Computing Contours on a Terrain ∗ Pankaj K. Agarwal Lars Arge Add to Reading List Source URL: users.cs.duke.edu Language: English - Date: 2015-07-24 06:57:53 Graph theory Eulerian path Matching Spanning tree Graph coloring NP-complete problems
3	Algorithms and Data Structures Winter TermExercises for UnitProve that the implementation for the DFS-framework presented in the lecture correctly identifies the strongly connected components in a directe Add to Reading List Source URL: www-tcs.cs.uni-sb.de Language: English - Date: 2016-03-14 05:26:21 Graph theory Graph connectivity Cycle Eulerian path Topological sorting Directed acyclic graph Strongly connected component Connected component Directed graph Graph Cyclic graph Depth-first search
4	Graph Theory November 15, Warmup: Cycle graphs Add to Reading List Source URL: math.colorado.edu Language: English - Date: 2015-12-04 19:21:55 Graph theory Bipartite graph Parity Hamiltonian path Eulerian path Cycle graph Adjacency matrix Chordal bipartite graph Line graph
5	Graph Editing to a Given Degree Sequence? Petr A. Golovach1,2 and George B. Mertzios3 1 Department of Informatics, University of Bergen, Norway, . 2 Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2016-03-02 03:52:29 Graph theory Mathematics Graph coloring Degree Graph Eulerian path Ear decomposition NP-complete problems Graph operations Dominating set Incidence coloring
6	CS264: Homework #10 Due by midnight on Wednesday, December 10, 2014 Instructions: (1) Students taking the course pass-fail should complete 5 of the exercises. Students taking the course for a letter grade should complete Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-12-10 00:55:12 Graph theory Mathematics Spanning tree Steiner tree problem Minimum spanning tree Shortest path problem Eulerian path Line graph Expected linear time MST algorithm Minimum bottleneck spanning tree
7	CS681: Advanced Topics in Computational Biology Week 7 Lectures 2-3 Can Alkan EA224 Add to Reading List Source URL: www.cs.bilkent.edu.tr Language: English - Date: 2012-03-26 04:52:47 Graph theory Mathematics Computational complexity theory NP-complete problems Hamiltonian path Eulerian path Travelling salesman problem Cycle Seven Bridges of Knigsberg Path NP-completeness Shortest path problem
8	CS261: Exercise Set #7 For the week of February 15–19, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza. Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-02-18 01:28:39 Graph theory Mathematics NP-complete problems Matroid theory Steiner tree problem Bipartite graph Eulerian path Graph Degree Ear decomposition Directed graph Cycle
9	NEW PROXIMITY-PRESERVING ORDERINGS FOR SPATIAL DATA Alan Saalfeld Bureau of the Census1 Washington, DC 20233 Add to Reading List Source URL: mapcontext.com Language: English - Date: 2008-08-29 21:44:38 Graph theory Mathematics Eulerian path Tree Cycle Degree Vertex Graph Ear decomposition Cycle space Pathwidth
10	Simpler and Better Approximation Algorithms for Network Design Anupam Gupta∗ Amit Kumar† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2005-11-30 21:17:11 Spanning tree NP-complete problems Routing algorithms Edsger W. Dijkstra Combinatorial optimization Steiner tree problem Minimum spanning tree Shortest path problem Eulerian path Algorithm Randomized algorithm Matching