Sciweavers

1632 search results - page 149 / 327
» On special numberings of hypergraphs
Sort
View
JGT
2007
99views more  JGT 2007»
15 years 6 months ago
Backbone colorings for graphs: Tree and path backbones
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, G...
PE
2002
Springer
109views Optimization» more  PE 2002»
15 years 6 months ago
Non-cooperative routing in loss networks
The paper studies routing in loss networks in the framework of a non-cooperative game with selfish users. Two solution concepts are considered: the Nash equilibrium, corresponding...
Eitan Altman, Rachid El Azouzi, Vyacheslav M. Abra...
PUC
2008
174views more  PUC 2008»
15 years 6 months ago
A wireless sensor networks MAC protocol for real-time applications
Abstract Wireless sensor networks (WSN) are designed for data gathering and processing, with particular requirements: low hardware complexity, low energy consumption, special traff...
Esteban Egea-López, Javier Vales-Alonso, Al...
RSA
2008
94views more  RSA 2008»
15 years 6 months ago
Random mappings with exchangeable in-degrees
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
Jennie C. Hansen, Jerzy Jaworski
MP
2010
99views more  MP 2010»
15 years 5 months ago
Separation, dimension, and facet algorithms for node flow polyhedra
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
Maren Martens, S. Thomas McCormick, Maurice Queyra...