Control of Robot Manipulators in Joint Space addresses robot control in depth, treating a
range of model-based controllers in detail: proportional derivative; proportional integral …

In this paper we present the Selective Graph Coloring Problem, a generalization of the
standard graph coloring problem as well as several of its possible applications. Given a …

Graph coloring is one of the oldest and best-known problems of graph theory. Statistics
show that graph coloring is one of the central issues in the collection of several hundred …

Modern high-performance communication networks pose a number of challenging problems
concerning the efficient allocation of resources to connection requests. In all-optical …

Optical networks and the related technologies, network management software and services
have undergone remarkable developments, and such networks are now the ultra-high …

We consider a new vertex coloring problem, that we call partition-coloring, in which the
vertex set of a graph G=(V; E) is partitioned into k disjoint sets V= V1 Vk, and G is said to be …

We introduce the following combinatorial optimization problem: Given a connected graph G,
find a spanning tree T of G with the smallest number of branch vertices (vertices of degree 3 …

This paper studies the off-line wavelength assignment problem in star and ring networks that
deploy multiple fibers between nodes and use wavelength division multiplexing (WDM) for …

Knödel graphs of even order n and degree 1⩽ Δ⩽⌊ log2 (n)⌋, WΔ, n, are graphs which
have been introduced some 25 years ago as the topology underlying a time optimal …

ROUTING IN ALL-OPTICAL NETWORKS: ALGORITHMIC AND GRAPH-THEORETIC
PROBLEMS Page 1 ROUTING IN ALL-OPTICAL NETWORKS: ALGORITHMIC AND GRAPH-THEORETIC …