2314 search results - page 181 / 463 » Minimal Partitions of a Graph |
128
click to vote
ENTCS
2008
15 years 4 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 ...
128
click to vote
JAIR
2008
15 years 4 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...
117
click to vote
JGT
2007
15 years 4 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...
112
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
140
click to vote
IEEECIT
2009
IEEE
15 years 10 months ago
2009
IEEE
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...