5473 search results - page 259 / 1095 » On the graph isomorphism problem |
170
click to vote
DISOPT
2006
15 years 7 months ago
2006
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
184
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
176
click to vote
COMBINATORICS
2006
15 years 7 months ago
2006
We expose a relationship between jamming and a generalization of Tutte's barycentric embedding. This provides a basis for the systematic treatment of jamming and maximal packi...
200
click to vote
BPM
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...
213
click to vote
APVIS
2001
15 years 8 months ago
2001
This paper demonstrates the application of graph drawing and information visualisation techniques to the visualisation of information which can be modelled as an attributed graph....