Sciweavers

9532 search results - page 419 / 1907
» Logic, Graphs, and Algorithms
Sort
View
WADS
2001
Springer
124views Algorithms» more  WADS 2001»
16 years 4 days ago
Deciding Clique-Width for Graphs of Bounded Tree-Width
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta ...
Wolfgang Espelage, Frank Gurski, Egon Wanke
DAM
2010
60views more  DAM 2010»
15 years 7 months ago
One-to-many node-disjoint paths in (n, k)-star graphs
We present an algorithm which given a source node and a set of n - 1 target nodes in the (n, k)-star graph Sn,k, where all nodes are distinct, builds a collection of n - 1 node-di...
Yonghong Xiang, Iain A. Stewart
AAECC
2005
Springer
114views Algorithms» more  AAECC 2005»
15 years 7 months ago
The adjacency graph of a real algebraic surface
Abstract. The paper deals with the question of recognizing the mutual positions of the connected components of a non-singular real projective surface S in the real projective 3-spa...
Elisabetta Fortuna, Patrizia M. Gianni, Domenico L...
WAIM
2010
Springer
15 years 5 months ago
Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
Weiren Yu, Xuemin Lin, Jiajin Le
FASE
2010
Springer
16 years 2 months ago
Memory Leaks Detection in Java by Bi-abductive Inference
This paper describes a compositional analysis algorithm for statically detecting leaks in Java programs. The algorithm is based on separation logic and exploits the concept of bi-a...
Dino Distefano, Ivana Filipovic