| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 24
reviews
|
|
|
 |
|
|
|
|
Sets, logic and maths for computing
Makinson D., Springer Publishing Company, Incorporated, 2008. 304 pp. Type: Book (9781846288449), Reviews: (1 of 2)
According to the author, the purpose of this book is:...
|
Jan 7 2009 |
|
|
|
|
|
|
Graphs and digraphs (4th ed.)
Chartrand G., Chapman & Hall/CRC, 2004. 400 pp. Type: Book (9781584883906)
This is the fourth edition of a classic textbook, first written in 1979, and now revised and extended. The book’s content covers a classical selection of the theory of graphs and digraphs. It focuses on a presentation of the ...
|
Jul 5 2006 |
|
|
|
|
|
|
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Demaine E., Fomin F., Hajiaghayi M., Thilikos D. Journal of the ACM 52(6): 866-893, 2005. Type: Article
Over the last few years, the theory of parameterized complexity has developed into a useful framework for a refined analysis of hard algorithmic problems. Several researchers have obtained exponential speedups in fixed-parameter algori...
|
Jun 1 2006 |
|
|
|
|
|
|
A linear time algorithm for the minimum weighted feedback vertex set on diamonds
Carrabs F., Cerulli R., Gentili M., Parlato G. Information Processing Letters 94(1): 29-35, 2005. Type: Article
A linear time solution of the weighted feedback vertex problem for diamond graphs is the main contribution of this paper. The result can be obtained from a more general result [1]. There, it is shown that the regarded problem is a line...
|
Jan 12 2006 |
|
|
|
|
|
|
3-coloring in time O(1.3289)
Beigel R., Eppstein D. Journal of Algorithms 54(2): 168-204, 2005. Type: Article
The main result of this paper is a proof that the three-coloring problem can be solved in worst-case time O(1.3289n). The previous record for this problem was the O(1....
|
Jul 5 2005 |
|
|
|
|
|
|
Fixed-parameter complexity in AI and nonmonotonic reasoning
Gottlob G., Scarcello F., Sideri M. Artificial Intelligence 138(1-2): 55-86, 2002. Type: Article
To study the interdependence of the computational complexity of algorithmic problems and the structural parameters of their input objects is one of the most promising lines of inquiry among attempts to understand complexity, and to un...
|
Jan 24 2003 |
|
|
|
|
|
|
Semi-dynamic breadth-first search in digraphs
Franciosa P., Giaccio R., Frigioni D. Theoretical Computer Science 250(1-2): 201-217, 2001. Type: Article
The paper investigates incremental and decremental algorithms for maintaining a breadth-first search tree (bfs-tree) for a digraph in O(n) amortized time per operation. More exactly, an algorithm and a data structure...
|
Oct 1 2001 |
|
|
|
|
|
|
Axiomatising extended computation tree logic
Kaivola R. Theoretical Computer Science 190(1): 41-60, 1998. Type: Article
The computation tree logic CTL*, which is used in the specification and verification of concurrent systems, is the result of adding path quantifiers to the standard propositional linear time temporal logic LTL. This paper investigates ...
|
Jan 1 1999 |
|
|
|
|
|
|
Optimal parallel algorithms for path problems on planar graphs
Srikrishna G., Rangan C. Theoretical Computer Science 145(1-2): 27-43, 1995. Type: Article
The two-disjoint connecting path problem (TPP) is investigated for the class of planar graphs. The authors give an O ( log n )-time algorithm on a concurrent-read concurrent write (CRCW) parallel r...
|
Oct 1 1996 |
|
|
|
|
|
|
Existence and construction of edge-disjoint paths on expander graphs
Broder A., Frieze A., Upfal E. SIAM Journal on Computing 23(5): 976-989, 1994. Type: Article
The disjoint connecting path problem is investigated for expander graphs. This problem is of interest for communication networks for parallel and distributed computing. Unfortunately, it is NP-hard for arbitrary graphs. The paper gives...
|
Feb 1 1996 |
|
|
|
|
|
| |
|
|
| |
|
|
