Special issue on computational methods for graph coloring and its generalizations
نویسندگان
چکیده
منابع مشابه
Special issue on modeling and computational methods in genomic sciences
The discovery of the double-helical structure of DNA is a landmark event which belongs to the past century, but with great influence, in this century, on the research activity on genetic and genomic sciences, due also to the completion of a high-quality comprehensive sequence of the human genome which has made. Indeed we may talk, as observed in [1], about the genome era. The above scientific e...
متن کاملSpecial Issue on Statistical and Computational Methods in Finance
In recent decades major developments in computational methods allowed revolutionary changes to take place in the statistical and econometric analysis of financial processes. Evaluating various forecasts and policy scenarios with their implied risk using advanced computational techniques and modern financial models is becoming more and more standard practice. The contents of this special issue r...
متن کاملKrausz dimension and its generalizations in special graph classes
In this paper we prove, that the problem ”kdim(G) ≤ 3” is polynomially solvable for chordal graphs, thus partially solving the problem of P. Hlineny and J. Kratochvil. We show, that the problem of finding m-krausz dimension is NP-hard for every m ≥ 1, even if restricted to (1,2)-colorable graphs, but the problem ”kdimm(G) ≤ k” is polynomially solvable for (∞, 1)-polar graphs for every fixed k,m...
متن کاملSpecial issue on computational finance
Many of the papers in this special issue were initially presented at the 2nd International Workshop on Parallel and Distributed Computing in Finance (PDCoF) held in conjunction with The 23rd International Parallel and Distributed Processing Symposium (IPDPS). The papers were significantly revised, extended for consideration in this special issue. The purpose of this special issue is to bring to...
متن کاملOn edge orienting methods for graph coloring
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge orienting problem is equivalent to finding the chromatic number of a graph. We study various properties of edge orienting methods in the context of local search for graph coloring. We then exploit these properties to d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.10.007