3204 search results - page 299 / 641 » The Alcuin Number of a Graph |
182
click to vote
WADS
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
168
click to vote
SAC
2004
ACM
16 years 4 days ago
2004
ACM
is an abstract graph reduction machine for the implementation of lazy functional languages. Categorical multi-combinators served as a basis for the evaluation model of µΓCMC. Th...
195
click to vote
INFOVIS
1999
IEEE
15 years 11 months ago
1999
IEEE
A new method is presented to get insight into univariate time series data. The problem addressed here is how to identify patterns and trends on multiple time scales (days, weeks, ...
168
click to vote
DAM
2002
15 years 6 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
174
click to vote
JAIR
2010
15 years 5 months ago
2010
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...