505 search results - page 17 / 101 » On A Graph Formalism for Ordered Edges |
WG
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
Video streams are ubiquitous in applications such as surveillance, games, and live broadcast. Processing and analyzing these data is challenging because algorithms have to be effic...
70
Voted
GG
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. Triple graph transformation has become an important approach for model transformations. Triple graphs consist of a source, a target and a connection graph. The correspond...
ECBS
2008
IEEE
15 years 4 months ago
2008
IEEE
Network designers perform challenging tasks with so many configuration options that it is often hard or even impossible for a human to predict all potentially dangerous situation...
GG
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already cruc...