9532 search results - page 66 / 1907 » Logic, Graphs, and Algorithms |
72
Voted
ASPDAC
2004
ACM
15 years 4 months ago
2004
ACM
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
ICPP
2006
IEEE
15 years 5 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
126
click to vote
ICALP
2005
Springer
15 years 4 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
92
Voted
VALUETOOLS
2006
ACM
15 years 5 months ago
2006
ACM
We present the software tool “Web Graph Analyzer”. This tool is designed to perform a comprehensive analysis of the Web Graph structure. By Web Graph we mean a graph whose ver...