9532 search results - page 169 / 1907 » Logic, Graphs, and Algorithms |
140
click to vote
CATS
2006
15 years 5 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
155
click to vote
CONSTRAINTS
2007
15 years 4 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
118
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
121
click to vote
WALCOM
2008
IEEE
15 years 5 months ago
2008
IEEE
Abstract. Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (...
126
click to vote
ACSC
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...