244 search results - page 24 / 49 » Intervalizing k-Colored Graphs |
120
Voted
ISSS
1998
IEEE
15 years 6 months ago
1998
IEEE
Complex system specifications are often hierarchically composed of several subsystems. Each subsystem contains one or more processes. In order to provide optimization across diffe...
125
Voted
LCTRTS
2007
Springer
15 years 8 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
131
click to vote
MP
2006
15 years 2 months ago
2006
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]...
94
Voted
CAGD
2007
15 years 2 months ago
2007
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...
136
click to vote
RC
2000
15 years 2 months ago
2000
Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implic...