3265 search results - page 206 / 653 » Representing Groups on Graphs |
134
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
136
click to vote
COCO
2007
Springer
15 years 10 months ago
2007
Springer
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
140
click to vote
SCAM
2006
IEEE
15 years 10 months ago
2006
IEEE
Call graphs are widely used to represent calling relationships among methods. However, there is not much interest in calling relationships among library methods in many software e...
128
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
We present an algorithm for finding shortest surface non-separating cycles in graphs embedded on surfaces in O(g3/2 V 3/2 log V + g5/2 V 1/2 ) time, where V is the number of vert...
124
click to vote
CAAN
2004
Springer
15 years 10 months ago
2004
Springer
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...