3267 search results - page 106 / 654 » Generalized quasirandom graphs |
103
click to vote
KDD
2008
ACM
15 years 11 months ago
2008
ACM
Attributed graphs are increasingly more common in many application domains such as chemistry, biology and text processing. A central issue in graph mining is how to collect inform...
BIRTHDAY
2005
Springer
15 years 4 months ago
2005
Springer
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
102
click to vote
ISAAC
2004
Springer
15 years 4 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
GD
2009
Springer
15 years 3 months ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
COCOON
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...