Graphs - PDFSEARCH.IO - Document Search Engine

Graphs
Results: 4392

#	Item
831	Gelling, and Melting, Large Graphs by Edge Manipulation Hanghang Tong B. Aditya Prakash Tina Eliassi-Rad Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2012-11-01 14:04:55
832	JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015 Computational Lower Bounds for Community Detection on Random Graphs Bruce Hajek Add to Reading List Source URL: jmlr.org Language: English - Date: 2015-07-20 20:08:36 Graph theory Computational complexity theory Mathematics NP-complete problems Dense subgraph Independent set Planted clique Clique Dense graph Hypergraph Graph coloring Subgraph isomorphism problem
833	Dense triangle-free graphs are four-colorable: A solution to the Erd˝ os-Simonovits problem. Stephan Brandt∗ Technische Universit¨at Ilmenau Fakult¨at f¨ Add to Reading List Source URL: perso.ens-lyon.fr Language: English - Date: 2011-08-22 06:36:00
834	Beyond Ohba’s Conjecture: A bound on the choice number of k-chromatic graphs with n vertices Jonathan A. Noel∗, Douglas B. West†, Hehui Wu‡, Xuding Zhu§ August 27, 2014 Abstract Add to Reading List Source URL: people.maths.ox.ac.uk Language: English - Date: 2014-08-27 06:35:07
835	The Saturation Function of Complete Partite Graphs Tom Bohman1,3 Maria Fonoberova2 Oleg Pikhurko1,4 Add to Reading List Source URL: homepages.warwick.ac.uk Language: English - Date: 2011-10-03 12:10:26
836	Microsoft Word - Annual Report 2015 graphs B.docx Add to Reading List Source URL: oneheartworld-wide.org Language: English - Date: 2016-02-22 12:39:17
837	THE ROBUST COMPONENT STRUCTURE OF DENSE REGULAR GRAPHS AND APPLICATIONS ¨ DANIELA KUHN, ALLAN LO, DERYK OSTHUS AND KATHERINE STADEN Abstract. In this paper, we study the large-scale structure of dense regular graphs. Add to Reading List Source URL: web.mat.bham.ac.uk Language: English - Date: 2014-11-19 02:19:17
838	VIZING’S CONJECTURE FOR CHORDAL GRAPHS ´ RON AHARONI AND TIBOR SZABO Abstract. Vizing [13] conjectured that γ(GH) ≥ γ(G)γ(H) for every pair G, H of graphs, where “” is the Cartesian product, and γ(G) is th Add to Reading List Source URL: page.mi.fu-berlin.de Language: English - Date: 2008-09-03 14:36:12
839	Efficient Processing of Large Graphs via Input Reduction 1 Amlan Kusum 1 Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2016-06-07 22:42:27
840	PowerLyra: Differentiated Graph Computation and Partitioning on Skewed Graphs Rong Chen, Jiaxin Shi, Yanzhe Chen, Haibo Chen Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Add to Reading List Source URL: ipads.se.sjtu.edu.cn Language: English - Date: 2015-03-30 09:08:29 Graph theory Vertex Graph Ear decomposition Distance Pathwidth Graph coloring

UPDATE