65 search results - page 2 / 13 » Graph Automorphism-Based Algorithm for Determining Symmetric... |
SCAM
2008
IEEE
13 years 11 months ago
2008
IEEE
Bug-checking tools have been used with some success in recent years to find bugs in software. For finding bugs that can cause security vulnerabilities, bug checking tools requir...
WG
2010
Springer
13 years 3 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
FSTTCS
2009
Springer
13 years 10 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
SGP
2004
13 years 7 months ago
2004
We propose a method for segmentation of 3D scanned shapes into simple geometric parts. Given an input point cloud, our method computes a set of components which possess one or mor...
FAW
2007
Springer
13 years 11 months ago
2007
Springer
In this paper, we consider the recognition problem on a class of perfectly orderable graphs, namely, the HHD-free graphs, i.e., graphs that do not contain any induced subgraph iso...