3267 search results - page 83 / 654 » Generalized quasirandom graphs |
117
Voted
ECEASST
2006
15 years 24 days ago
2006
Graph programs allow a visual description of programs on graphs and graph-like structures. The correctness of a graph program with respect to a pre- and a postcondition can be show...
102
Voted
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
The title of this paper, besides being a pun, can be taken to mean either the frontier of research in graph transformation, or the advantage of using graph transformation. To focus...
101
Voted
ICALP
2003
Springer
15 years 6 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
102
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
123
Voted
EJC
2008
15 years 26 days ago
2008
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...