6740 search results - page 340 / 1348 » An s -Hamiltonian Line Graph Problem |
125
click to vote
ESA
2009
Springer
15 years 11 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
115
click to vote
COMBINATORICS
2006
15 years 4 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...
149
click to vote
BPM
2008
Springer
15 years 6 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 ...
146
click to vote
APVIS
2001
15 years 5 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....
152
click to vote
ECEASST
2006
15 years 4 months ago
2006
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...