Vertex - PDFSEARCH.IO - Document Search Engine

Vertex
Results: 1582

#	Item
311	VCH - 20A ÷ 90A/VIR - 25A ÷ 90A Ref: N-40305_1 0509 E Reversibles aire - aire. Serie VITALITY Add to Reading List Source URL: www.vertex.ru Language: Spanish - Date: 2016-03-31 11:27:24
312	Parameterized Complexity of Critical Node Cuts Danny Hermelin1 , Moshe Kaspi1 , Christian Komusiewicz2 , and Barak Navon1 1 2 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2015-11-09 10:22:02 Graph theory Mathematics Treewidth Clique Vertex Tree decomposition Centrality Graph Degree Pathwidth Logic of graphs
313	A 4k 2 kernel for feedback vertex set St´ephan Thomass´e∗ Universit´e Montpellier II - CNRS, LIRMM, 161 rue Ada, 34392 Montpellier Cedex, France Add to Reading List Source URL: perso.ens-lyon.fr Language: English - Date: 2011-08-22 06:36:01
314	Partitioning a graph into a cycle and an anticycle, a proof of Lehel’s conjecture St´ephane Bessy and St´ephan Thomass´e∗ Abstract We prove that every graph G has a vertex partition into a cycle and an anticycle ( Add to Reading List Source URL: perso.ens-lyon.fr Language: English - Date: 2011-08-22 06:36:00
315	The Complexity of Degree Anonymization by Vertex AdditionI Robert Bredereck1 , Vincent Froese2 , Sepp Hartung, Andr´e Nichterlein, Rolf Niedermeier, Nimrod Talmon3 Institut f¨ ur Softwaretechnik und Theoretische Inform Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-08-20 10:35:46
316	Outerplanar Obstructions for Feedback Vertex Set∗† Juanjo Ru´e‡§ Konstantinos S. Stavropoulos¶k Dimitrios M. Thilikos¶∗∗ Add to Reading List Source URL: www-ma2.upc.edu Language: English - Date: 2009-12-01 16:40:10
317	Replication-based Fault-tolerance for Large-scale Graph Processing Peng Wang† Kaiyuan Zhang† Rong Chen† Haibo Chen† Haibing Guan§ Shanghai Key Laboratory of Scalable Computing and Systems †Institute of Paralle Add to Reading List Source URL: ipads.se.sjtu.edu.cn Language: English - Date: 2014-04-25 11:30:00 Graph theory Fault-tolerant computer systems Vertex Application checkpointing Connectivity Graph Replication
318	THE TOTAL ACQUISITION NUMBER OF RANDOM GRAPHS DEEPAK BAL, PATRICK BENNETT, ANDRZEJ DUDEK, AND PAWEL PRALAT Abstract. Let G be a graph in which each vertex initially has weight 1. In each step, the weight from a vertex u Add to Reading List Source URL: homepages.wmich.edu Language: English - Date: 2014-02-12 14:59:08
319	Lecture 10: Graph Data Structures Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794–4400 Add to Reading List Source URL: www3.cs.stonybrook.edu Language: English - Date: 2008-06-19 03:42:13 Graph theory Graph Directed graph Dense graph Ear decomposition Vertex Connected component Line graph Logic of graphs
320	Some remarks on vertex Folkman numbers for hypergraphs Andrzej Dudek∗ Reshma Ramadurai† June 7, 2012 Add to Reading List Source URL: homepages.wmich.edu Language: English - Date: 2012-06-07 16:40:32

UPDATE