Graph - PDFSEARCH.IO - Document Search Engine

Graph
Results: 12817

#	Item
721	Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs Michael R. Fellows1 , Guillaume Fertin2 , Danny Hermelin?3 , and St´ephane Vialette4 1 School of Electrical Engineering and Computer Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2011-04-27 12:10:56 Graph theory Graph coloring Treewidth Color-coding Matching Clique Graph minor Tree decomposition
722	Novel tree edit operations for RNA secondary structure comparison Julien Allali1 and Marie-France Sagot2 1 Institut Gaspard-Monge, Universit´e de Marne-la-Vall´ee, Cit´e Descartes, Champs-sur-Marne, 77454 Add to Reading List Source URL: pbil.univ-lyon1.fr Language: English - Date: 2008-10-22 02:35:19 Graph theory Binary trees Biology Computing Knowledge representation Tree T-tree B-tree Dynamic programming RNA Tree alignment Redblack tree
723	Community-Aware Mobile Networking Michael Kuhn Computer Engineering and Networks Laboratory ETH Zurich 8092 Zurich, Switzerland Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:47 Mathematics Graph theory Network theory Discrete mathematics Edsger W. Dijkstra Graph Shortest path problem Topological graph theory Isomap
724	CS264: Homework #5 Due by midnight on Wednesday, October 29, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at http://rishig.sc Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-10-27 18:59:34 Graph theory NP-complete problems Clique Clique cover Graph coloring
725	User Guide for Wimmut Client (Version 0.1) User Guide for Wimmut Client Introduction Quick Start Simple Use Cases Add to Reading List Source URL: dms.sztaki.hu Language: English - Date: 2011-12-01 11:20:48 Graph theory Graph drawing Force-directed graph drawing Vertex Graph operations Pathwidth
726	Locality in Networks Jukka Suomela Helsinki Institute for Information Technology HIIT Department of Computer Science, University of Helsinki Foundations of Network Science Workshop Riga, 7 July 2013 Add to Reading List Source URL: users.ics.aalto.fi Language: English - Date: 2013-12-09 16:38:32 Graph theory Mathematics Combinatorial optimization Matching
727	Algorithms and Data Structures Winter TermExercises for Units 37 & 38 1. For stable matching with incomplete lists, each man x ∈ X has a strict list x over a subset of the women Y, i.e., x is possibly incomp Add to Reading List Source URL: www-tcs.cs.uni-sb.de Language: English - Date: 2016-03-30 16:37:02 Mathematics Graph theory Matching Discrete mathematics Combinatorics Cooperative games Game theory Combinatorial optimization Stable marriage problem Stable roommates problem 3-dimensional matching
728	Distributed Community Detection on Edge-labeled Graphs using Spark San-Chuan Hung Miguel Araujo Add to Reading List Source URL: www.mlgworkshop.org Language: English - Date: 2016-08-14 01:22:56 Graph theory Mathematics Multilinear algebra Tensors Matroid theory Multivariate statistics Higher-order singular value decomposition Ear decomposition Graph Line graph Non-negative matrix factorization Bridge
729	Spectral Graph Theory Lecture 24 Ramanujan Graphs of Every Size Daniel A. Spielman Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2015-12-02 10:25:24 Mathematics Algebra Polynomials Orthogonal polynomials Eigenvalues and eigenvectors Chebyshev polynomials Classical orthogonal polynomials
730	Algorithms and Data Structures Winter TermExercises for Units 25 & 26 1. Suppose you are given a directed graph G = (V, E), two vertices s and t, a capacity function c : E → R+ , and another function f : E → Add to Reading List Source URL: www-tcs.cs.uni-sb.de Language: English - Date: 2016-03-17 15:32:23 Graph theory Mathematics Network flow Graph connectivity Combinatorial optimization Maximum flow problem Cut Flow network Max-flow min-cut theorem Minimum-cost flow problem

UPDATE