1149 search results - page 107 / 230 » Minimally non-Pfaffian graphs |
147
click to vote
EJC
2010
15 years 6 months ago
2010
We introduce the idea of Assur graphs, a concept originally developed and exclusively employed in the literature of the kinematics community. The paper translates the terminology,...
162
click to vote
ENTCS
2008
15 years 6 months ago
2008
We define transactional graph transformation systems (t-gtss), a mild extension of the ordinary framework for the double-pushout approach to graph transformation, which allows to ...
153
click to vote
JAIR
2008
15 years 6 months ago
2008
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
141
click to vote
JGT
2007
15 years 6 months ago
2007
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and expl...
150
click to vote
COCOC
1995
15 years 10 months ago
1995
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree o...