MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Nicolas Hanusse" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 14 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • On Compact Encoding of Pagenumber k Graphs  
  • by Cyril Gavoille, Nicolas Hanusse — 2001
  • …this paper we show an information-theoretic lower bound of kn o(kn) on the minimum number of bits to represent an unlabeled connected n-node graph of pagenumber k. This has to be compared with the efficient encoding scheme of Munro and Raman of 2kn +2m+o(n) bits, that is 4kn +2n k…
  • Cited by 3 (1 self) – Add To MetaCart
  • Compact Routing Tables for Graphs of Bounded Genus  
  • by Cyril Gavoille, Nicolas Hanusse — 2000
  • …This paper deals with compact shortest path routing tables on weighted graphs with n nodes. For planar graphs we show how to construct in linear time shortest path routing tables that require 8n + o(n) bits per node, and O(log 2+ n) bit-operations per node to extract the route, for any constant > 0.…
  • Cited by 22 (11 self) – Add To MetaCart
  • Towards small world emergence  
  • by Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel — 2006 — In Proceedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures
  • …We investigate the problem of optimizing the routing performances of a virtual network by adding extra random links. Our asynchronous and distributed algorithm ensures, by adding a single extra link per node, that the resulting network is a navigable small world, i.e., in which greedy routing, using…
  • Cited by 7 (1 self) – Add To MetaCart
  • Brief announcement: Could any graph be turned into a small world  
  • by Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel — 2005 — Proc. of the 19th Inter. Symp. on Distr. Comp. (DISC
  • …Introduction. In the last decade, effective measurements of real interaction networks have revealed specific unexpected properties. Among these, most of these networks present a very small diameter and a high clustering. Furthermore, very short paths can be efficiently found between any pair of node…
  • Cited by 1 (1 self) – Add To MetaCart
  • Searching with Mobile Agents in Networks with Liars  
  • by Nicolas Hanusse, Evangelos Kranakis, Danny Krizanc — 2002 — In Proc. EUROPAR'2000, LNCS 1900
  • …We present deterministic algorithms to search for an item s contained in a node of a network, without prior knowledge of its exact location. Each node of the network has a database that will answer queries of the form \how do I get to s?" by responding with the rst edge on a shortest path to the…
  • Cited by 3 (2 self) – Add To MetaCart
  • An Information Upper Bound of Planar Graphs Using Triangulation  
  • by Nicolas Bonichon, Nicolas Bonichon, Cyril Gavoille, Cyril Gavoille, Nicolas Hanusse, Nicolas Hanusse — 2002
  • …We propose a new linear time algorithm to represent a planar graph. Based on a speci c triangulation of the graph, our coding takes on average 5:03 bits per node, and 3:37 bits per node if the graph is maximal. We derive from this representation that the number of unlabeled planar graphs with n …
  • Cited by 1 (1 self) – Add To MetaCart
  • Memoryless Search Algorithms In A Network With Faulty Advice  
  • by Nicolas Hanusse, Dimitris Kavvadias, Evangelos Kranakis, Danny Krizanc — 2002
  • …In this paper, we present a randomized algorithm for a mobile agent to search for an item t stored at a node of a network, without prior knowledge of its exact location. Each node of the network has a database that will answer queries of the form "how do I get to t?" by responding with the first edg…
  • Cited by 4 (0 self) – Add To MetaCart
  • Planar graphs, via well-orderly maps and trees  
  • by Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer — 2004 — In 30 th International Workshop, Graph - Theoretic Concepts in Computer Science (WG), volume 3353 of Lecture Notes in Computer Science
  • …Abstract. The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map. We show that the number of well-orderly maps with n nodes is at most 2 αn+O(log n) , where α ≈ 4.91. A direct consequ…
  • Cited by 5 (1 self) – Add To MetaCart
  • Cacti, Braids and Complex Polynomials  
  • by Mohamed El Marraki, Nicolas Hanusse, Er Zvonkin — 1996 — Sém. Lothar. Combin
  • …The study of the topological classification of complex polynomials began in the XIX-th century by Luroth (1871), Clebsch (1873) and Hurwitz (1891). In the works of Zdravkovska [23] and Khovanskii and Zdravkovska [17] the problem is reduced to a purely combinatorial one, that of the study of a ce…
  • Cited by 2 (0 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB