6740 search results - page 278 / 1348 » An s -Hamiltonian Line Graph Problem |
106
Voted
CAISE
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Specification of systems in a software product line (product-line members) is often supported by domain-specific languages (DSLs) that provide pownguage abstractions for ...
111
Voted
TPHOL
2008
IEEE
15 years 7 months ago
2008
IEEE
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
103
click to vote
BPM
2009
Springer
15 years 7 months ago
2009
Springer
We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the applicat...
120
Voted
SGAI
2004
Springer
15 years 6 months ago
2004
Springer
We exploit the combinatorial structure of conceptual graphs in order to obtain faster execution time when computing projection, which is a core generalisation-specialisation relat...
122
click to vote
AE
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...