Sciweavers

524 search results - page 48 / 105
» On the Maximum Number of Cliques in a Graph
Sort
View
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
14 years 5 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen
COCOON
2005
Springer
14 years 1 months ago
On the Complexity of the Balanced Vertex Ordering Problem
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...
Jan Kára, Jan Kratochvíl, David R. W...
JGT
2006
95views more  JGT 2006»
13 years 7 months ago
Maximal independent sets in graphs with at most r cycles
We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with n vertices and at most r cycles. The second family i...
Goh Chee Ying, Koh Khee Meng, Bruce E. Sagan, Vinc...
IJCV
2007
115views more  IJCV 2007»
13 years 7 months ago
Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
Andrea Torsello, Antonio Robles-Kelly, Edwin R. Ha...
SBACPAD
2006
IEEE
148views Hardware» more  SBACPAD 2006»
14 years 1 months ago
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...
Vasanth Krishna Namasivayam, Animesh Pathak, Vikto...