2435 search results - page 252 / 487 » Question Answering in Webclopedia |
160
click to vote
DAM
2006
15 years 6 months ago
2006
In the precoloring extension problem we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a ...
162
click to vote
DM
2006
15 years 6 months ago
2006
We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem was Lex M, which was presented in 1976. A new algorithm, and a simplific...
123
click to vote
DM
2006
15 years 6 months ago
2006
We answer a question raised by Brass on the number of maximally repeated sub-patterns in a set of n points in Rd. We show that this number, which was conjectured to be polynomial,...
164
click to vote
ISSE
2006
15 years 6 months ago
2006
Can Design Patterns be turned into reusable components? To help answer this question, we have performed a systematic study of the standard design patterns. One of the most ing is ...
153
click to vote
DAM
2007
15 years 6 months ago
2007
: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...