Search

Search Results

1. An Introduction to Coding Sequences of Graphs

   In this paper, we introduce a new representation of simple undirected graphs in terms of set of vectors in finite dimensional vector spaces over...

   Shamik Ghosh, Raibatak Sen Gupta, M. K. Sen in Combinatorial Optimization and Applications

   Conference paper 2016
   

2. The graph with spectrum 14¹ 2⁴⁰ (−4)¹⁰ (−6)⁹

   We show that there is a unique graph with spectrum as in the title. It is a subgraph of the McLaughlin graph. The proof uses a strong form of the...

   Aart Blokhuis, Andries E. Brouwer, Willem H. Haemers in Designs, Codes and Cryptography

   Article Open access 14 June 2011

3. On the Computational Complexity of Degenerate Unit Distance Representations of Graphs

   Some graphs admit drawings in the Euclidean k-space in such a (natural) way, that edges are represented as line segments of unit length. Such...

   Boris Horvat, Jan Kratochvíl, Tomaž Pisanski in Combinatorial Algorithms

   Conference paper 2011
   

4. Random key predistribution for wireless sensor networks using deployment knowledge

   We consider a key distribution scheme for wireless sensor networks which uses deployment knowledge. Deployment is modeled as a grid of hexagonal...

   J. Jaworski, M. Ren, K. Rybarczyk in Computing

   Article 10 May 2009

5. From graph states to two-graph states

   The name ‘ graph state ’ is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement...

   Constanza Riera, Stéphane Jacob, Matthew G. Parker in Designs, Codes and Cryptography

   Article 28 February 2008

6. On the Crossing Number of Almost Planar Graphs

   Crossing minimization is one of the most challenging algorithmic problems in topological graph theory, with strong ties to graph drawing...

   Petr Hliněný, Gelasio Salazar in Graph Drawing

   Conference paper 2007
   

7. Drawing Subway Maps: A Survey

   This paper deals with automating the drawing of subway maps. There are two features of schematic subway maps that make them different from...

   Alexander Wolff in Informatik - Forschung und Entwicklung

   Article Open access 29 November 2007

8. Approximating the Crossing Number of Toroidal Graphs

   CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout....

   Petr Hliněný, Gelasio Salazar in Algorithms and Computation

   Conference paper 2007
   

9. On the Crossing Number of Complete Graphs

   Let ( G ) denote the rectilinear crossing number of a graph G . We determine ( K ₁₁ )=102 and ( K ₁₂ )=153. Despite the remarkable hunt for crossing numbers...

   O. Aichholzer, F. Aurenhammer, H. Krasser in Computing

   Article 25 August 2005

10. Crossing Number Is Hard for Cubic Graphs

    It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used...

    Petr Hliněný in Mathematical Foundations of Computer Science 2004

    Conference paper 2004