WALCOM
2010
IEEE
13 years 9 months ago
2010
IEEE
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
WALCOM
2010
IEEE
13 years 9 months ago
2010
IEEE
WALCOM
2010
IEEE
13 years 9 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
WALCOM
2010
IEEE
13 years 9 months ago
2010
IEEE
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
WALCOM
2010
IEEE
14 years 5 months ago
2010
IEEE
WALCOM
2010
IEEE
14 years 5 months ago
2010
IEEE
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
WALCOM
2010
IEEE
14 years 5 months ago
2010
IEEE
WALCOM
2010
IEEE
14 years 5 months ago
2010
IEEE
WALCOM
2010
IEEE
14 years 5 months ago
2010
IEEE
WALCOM
2010
IEEE
14 years 5 months ago
2010
IEEE
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number i...