796 search results - page 51 / 160 » Graph Properties Based Filtering |
132
click to vote
SIROCCO
1997
15 years 3 months ago
1997
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual “probabilistic construction”. Also, the best k...
116
Voted
CN
2008
15 years 2 months ago
2008
Capacity is an important property for QoS support in Mobile Ad Hoc Networks (MANETs) and has been extensively studied. However, most approaches rely on simplified models (e.g., pr...
109
Voted
ICECCS
1997
IEEE
15 years 6 months ago
1997
IEEE
Software architectures can play a role in improving the testing process of complex systems. In particular, descriptions of the software architecture can be useful to drive integra...
123
Voted
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
178
click to vote
CORR
2004
Springer
15 years 2 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...