Sciweavers

121 search results - page 8 / 25
» A New Exam Scheduling Algorithm Using Graph Coloring
Sort
View
ICALP
2009
Springer
14 years 7 months ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
DAC
1998
ACM
14 years 8 months ago
Efficient Coloring of a Large Spectrum of Graphs
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
Darko Kirovski, Miodrag Potkonjak
FSTTCS
2004
Springer
14 years 23 days ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
ICIAP
2003
ACM
14 years 18 days ago
Color matching by using tuple matching
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
Dirk Balthasar
GD
2006
Springer
13 years 11 months ago
Parameterized st -Orientations of Graphs: Algorithms and Experiments
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
Charalampos Papamanthou, Ioannis G. Tollis