Graph labeling - PDFSEARCH.IO - Document Search Engine

Graph labeling
Results: 41

#	Item
1	Distinguishing graphs with intermediate growth Florian Lehner∗ January 3, 2013 A graph G is said to be 2-distinguishable if there is a 2-labeling of its Add to Reading List Source URL: www.florian-lehner.net Language: English - Date: 2014-07-18 04:55:27
2	Chi-Han Peng & Peter Wonka / Connectivity Editing for Quad-Dominant Meshes Additional Materials Figure 17: The two possible outcomes (depending on the pvertex/d-vertex labeling) in the primal domain √ by applying a Add to Reading List Source URL: peterwonka.net Language: English - Date: 2013-06-17 17:23:15 Polyhedra Polytopes Geometry Dual polyhedron Planar graph Mathematics 3D computer graphics Discrete mathematics Mesh generation
3	L(p, q) Labeling of d-Dimensional Grids∗ Guillaume Fertin1 , Andr´e Raspaud2 1 LINA FRE CNRS 2729, Universit´e de Nantes Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:57:12 Mathematics Discrete mathematics Graph coloring Polytopes Mathematical notation
4	Ephemeral Networks with Random Availability of Links: The case of fast networksI Eleni C. Akridaa,∗, Leszek Gąsienieca , George B. Mertziosb , Paul G. Spirakisa,c,d a Department of Computer Science, University of Liv Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2015-10-21 12:18:19 Graph theory Mathematics Line graph Tree Random graph Graph labeling Graph Graph coloring Centrality
5	Weak Sense of Direction Labelings and Graph Embeddings Christine T. Cheng∗ Ichiro Suzuki† December 27, 2010 Add to Reading List Source URL: www.cs.uwm.edu Language: English - Date: 2010-12-27 12:34:40 Graph theory Graph labeling Partial cube Cayley graph Graph coloring Edge-graceful labeling
6	Dynamic Graph Labeling Andreas Kinell Instructors: Regina O’Dell Roger Wattenhofer November 6, 2004 Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:37:00 Graph theory NP-complete problems Graph Graph coloring Planar graph Dominating set Connectivity Graph operations Planar separator theorem
7	On Computing the Distinguishing Numbers of Trees and Forests Christine T. Cheng Department of Computer Science University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA. Add to Reading List Source URL: www.cs.uwm.edu Language: English - Date: 2006-02-16 16:28:46 Tree Enumerative combinatorics Combinatorics Algebraic graph theory BassSerre theory Edge-graceful labeling
8	Distance Three Labelings of Trees∗ Jiˇr´ı Fiala† Petr A. Golovach‡ Bernard Lidick´ Add to Reading List Source URL: orion.math.iastate.edu Language: English - Date: 2014-08-22 14:45:05 NP-complete problems Graph coloring NP-hard problems Graph theory Planar graphs Treewidth Graph Independent set Tree decomposition Outerplanar graph Tree Graph labeling
9	PDF Document Add to Reading List Source URL: www.francescobonchi.com Language: English - Date: 2012-06-01 18:00:50 Graph theory Mathematics Cluster analysis Correlation clustering Cluster labeling Graph Clique Graph coloring Determining the number of clusters in a data set HCS clustering algorithm
10	Compact Ancestry Labeling Schemes for XML Trees∗ Pierre Fraigniaud† Abstract An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2010-02-08 08:23:33 Implicit graph Tree Binary trees B-tree Tango tree Tree decomposition Graph theory Mathematics Universal graph