Sciweavers

223 search results - page 40 / 45
» A Note on Graph Pebbling
Sort
View
GRAPHITE
2007
ACM
13 years 11 months ago
Anna Ursyn
This review tells about the International Conference on Information Visualization that is held annually in London, England. Themes selected from the Conference Proceedings are foc...
Anna Ursyn
WG
1995
Springer
13 years 11 months ago
Modular Decomposition of Hypergraphs
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
Paola Bonizzoni, Gianluca Della Vedova
JCT
2006
77views more  JCT 2006»
13 years 7 months ago
There are uncountably many topological types of locally finite trees
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of va...
Lilian Matthiesen
TON
2008
122views more  TON 2008»
13 years 7 months ago
Distributed throughput maximization in wireless mesh networks via pre-partitioning
Abstract-- This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number ...
Andrew Brzezinski, Gil Zussman, Eytan Modiano
AI
2002
Springer
13 years 7 months ago
Coherence in finite argument systems
Systems provide a rich abstraction within which divers concepts of reasoning, acceptability and defeasibility of arguments, etc., may be studied using a unified framework. Two imp...
Paul E. Dunne, Trevor J. M. Bench-Capon