Vertex - PDFSEARCH.IO - Document Search Engine

Vertex
Results: 1582

#	Item
461	Unavoidable subtrees Maria Axenovich∗ and Georg Osang† July 5, 2012 Abstract Let Tk be a family of all k-vertex trees. For T ⊆ Tk and a tree T , we write T → T if Add to Reading List Source URL: www.math.kit.edu Language: English - Date: 2012-09-20 07:53:57
462	Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching Sayan Bhattacharya∗ Monika Henzinger† Add to Reading List Source URL: eprints.cs.univie.ac.at Language: English - Date: 2014-10-08 05:51:37
463	1 WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX? MARIA AXENOVICH Abstract. It is well known that any two longest paths in a connected graph share a vertex. It is also known that there are connected graphs where 7 lon Add to Reading List Source URL: www.math.kit.edu Language: English - Date: 2012-09-05 04:03:35
464	Visibility Number of Directed Graphs Maria Axenovich∗, Andrew Beveridge†, Joan P. Hutchinson‡, Douglas B. West§ Abstract A k-bar visibility representation of a digraph G assigns each vertex at most k horizontal se Add to Reading List Source URL: www.math.kit.edu Language: English - Date: 2012-09-05 04:03:35
465	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 Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2012-01-23 02:46:04
466	© Copyright 1996 Georges A. Winkenbach Computer-Generated Pen-and-Ink Illustration by Add to Reading List Source URL: grail.cs.washington.edu Language: English - Date: 2001-06-14 11:05:22 Video game design Drawing Rendering Texture mapping Vertex 3D modeling Clipping Visual arts Vision Computer graphics 3D computer graphics Visual effects
467	CHAPTER 14 Drawing surfaces in 3D Only in mathematics books do spheres look like the thing on the left below, rather than the one on the right. Add to Reading List Source URL: www.math.ubc.ca Language: English - Date: 2009-01-11 23:09:30 Deltahedra 3D computer graphics Polyhedron Shading Polygon Icosahedron Tetrahedron Octahedron Vertex Geometry Euclidean geometry Platonic solids
468	Vertex Cover Gets Faster and Harder on Low Degree Graphs Akanksha Agrawal1 , Sathish Govindarajan1 , Neeldhara Misra1 Indian Institute of Science, Bangalore {akanksha.agrawal\|gsat\|neeldhara}@csa.iisc.ernet.in Add to Reading List Source URL: drona.csa.iisc.ernet.in Language: English - Date: 2014-08-01 08:33:48 NP-complete problems Vertex cover Vertex Graph Hamiltonian path Tree Clique Neighbourhood Connectivity Graph theory Mathematics Theoretical computer science
469	CME 305: Discrete Mathematics and Algorithms 1 Approximation Algorithms Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:44:41 Operations research Computational complexity theory NP-complete problems Job shop scheduling Mathematical optimization Approximation algorithm Linear programming Algorithm Vertex cover Theoretical computer science Applied mathematics Mathematics
470	A Formalism for Graph Databases and its Model of Computation Juan Reutter and Tony Tan University of Edinburgh Abstract. Graph databases are directed graphs in which the edges are labeled with symbols from a finite alpha Add to Reading List Source URL: web.ing.puc.cl Language: English - Date: 2013-12-24 11:08:55 Vertex Matching Matroid theory Graph operations Skew-symmetric graph Graph theory Graph Directed graph

UPDATE