Tree-depth - PDFSEARCH.IO - Document Search Engine

Tree-depth
Results: 64

#	Item
11	Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond Klaus-Tycho F¨ orster, Rijad Nuridini, Jara Uitto, and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerlan Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-07-11 07:39:59 Graph theory Pursuit-evasion Planar graph Matching Graph Neighbourhood Graph coloring Entanglement Graph operations Tree-depth
12	Efficient Densest Subgraph Computation in Evolving Graphs Alessandro Epasto∗ Silvio Lattanzi Add to Reading List Source URL: www.epasto.org Language: English - Date: 2015-07-21 16:42:36 Graph theory Mathematics Spanning tree Dense subgraph Graph coloring Combinatorial optimization Routing algorithms Line graph Tree-depth
13	arXiv:1104.2132v2 [math.CO] 15 FebOn the tree–depth of random graphs ∗ G. Perarnau and O.Serra February 16, 2012 Add to Reading List Source URL: arxiv.org Language: English - Date: 2012-02-16 00:29:30
14	Forbidden Graphs for Tree-depth Zdeněk Dvořák Archontia C. Giannopoulou Dimitrios M. Thilikos Abstract For every k ≥ 0, we define Gk as the class of graphs with tree-depth Add to Reading List Source URL: iti.mff.cuni.cz Language: English - Date: 2016-02-04 05:53:37
15	Tree & Shrub Planting Guide • Dig a shallow, broad hole. Think of it as a saucer, about the depth of root ball, never deeper and twice as wide. The more you can break up the soil around your new tree, the better. On n Add to Reading List Source URL: www.familytreenursery.com Language: English - Date: 2015-05-18 15:53:35
16	In-Depth Coverage of the Icon Programming Language June 1991 Number 6 In this issue … Modeling String Scanning … 1 Add to Reading List Source URL: www.cs.arizona.edu Language: English - Date: 1998-11-16 14:45:09 Procedural programming languages Find Searching Icon Pointer C ALGOL 68 ECL programming language Binary tree Computing Software engineering Computer programming
17	swetodblp_neg_stats_qcnt.eps Add to Reading List Source URL: www.cs.rpi.edu Language: English - Date: 2012-03-05 14:08:57 Directed acyclic graph Graph Binary tree Depth-first search Connected component Shortest path problem Signed graph Graph theory Mathematics Combinatorics
18	PDF Document Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2008-09-08 14:27:28 Depth-first search Tree decomposition Decomposition method Complexity of constraint satisfaction Graph theory Constraint programming Constraint graph
19	Algorithms Lecture 19: Depth-First Search [Fa’14] Ts’ui Pe must have said once: I am withdrawing to write a book. And another time: I am withdrawing to construct a labyrinth. Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:54 Connected component Longest path problem Tree Graph Topological sorting Vertex Connectivity Edge contraction Aperiodic graph Graph theory Depth-first search Directed acyclic graph
20	A New Approach to Incremental Topological Ordering Michael A. Bender∗ Jeremy T. Fineman† Abstract Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2009-11-24 09:49:23 Search algorithms Network flow Topological sorting Directed acyclic graph Depth-first search Minor Tree NP-complete problems Spanning tree Graph theory Mathematics Combinatorics