Sciweavers

354 search results - page 43 / 71
» The Chromatic Number Of Graph Powers
Sort
View
SAC
2008
ACM
15 years 5 months ago
Mining fault-tolerant frequent patterns efficiently with powerful pruning
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
Jhih-Jie Zeng, Guanling Lee, Chung-Chi Lee
MKM
2009
Springer
16 years 24 days ago
Exploring a Quantum Theory with Graph Rewriting and Computer Algebra
Graphical languages provide a powerful tool for describing the behaviour of quantum systems. While the use of graphs vastly reduces the complexity of many calculations [4,10], manu...
Aleks Kissinger
ICMT
2009
Springer
16 years 24 days ago
A Collection Operator for Graph Transformation
Abstract. Graph transformation has a well-established theory and associated tools that can be used to perform model transformations. However, the lack of a construct to match and t...
Roy Grønmo, Stein Krogdahl, Birger Mø...
ICALP
2003
Springer
15 years 11 months ago
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
GBRPR
2007
Springer
16 years 12 days ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke