505 search results - page 27 / 101 » On A Graph Formalism for Ordered Edges |
DM
2010
14 years 9 months ago
2010
The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, sta...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
ECEASST
2010
14 years 7 months ago
2010
In this talk we will present a new approach to deal with attributed graphs and attributed graph transformation. The approach is based on working with what we call symbolic graphs, ...
85
Voted
DM
2008
14 years 9 months ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
WEA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...