Sciweavers

2354 search results - page 205 / 471
» Radio number for trees
Sort
View
CJCDGCGT
2005
Springer
15 years 8 months ago
Fractional Vertex Arboricity of Graphs
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph. The f...
Qinglin Yu, Lian-Cui Zuo
ACID
2006
298views Algorithms» more  ACID 2006»
15 years 8 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
BROADBAND
1998
15 years 8 months ago
Blocking of dynamic multicast connections in a single link
In this paper, a method for calculating blocking experienced by dynamic multicast connections in a single link is presented. A service center at the root of a tree-type network pr...
Jouni Karvo, Jorma T. Virtamo, Samuli Aalto, Olli ...
DAM
2010
132views more  DAM 2010»
15 years 6 months ago
Homomorphisms of 2-edge-colored graphs
In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2...
Amanda Montejano, Pascal Ochem, Alexandre Pinlou, ...
COLING
2002
15 years 6 months ago
Best Analysis Selection in Inflectional Languages
Ambiguity is the fundamental property of natural language. Perhaps, the most burdensome case of ambiguity manifests itself on the syntactic level of analysis. In order to face up ...
Ales Horák, Pavel Smrz