1729 search results - page 48 / 346 » On Bounds for the k-Partitioning of Graphs |
MOBICOM
2012
ACM
13 years 9 days ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
194
click to vote
DNA
2011
Springer
13 years 9 months ago
2011
Springer
Sticker complexes are a a formal graph-based data model for a restricted class of DNA complexes, motivated by potential applications to databases. This data model allows for a pure...
JGT
2007
14 years 9 months ago
2007
: Let G be a 3-connected planar graph and G∗ be its dual. We show that the pathwidth of G∗ is at most 6 times the pathwidth of G. We prove this result by relating the pathwidth...
105
click to vote
RSA
2010
14 years 8 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
ESA
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...