6413 search results - page 79 / 1283 » Classes of cycle bases |
145
Voted
SODA
2012
ACM
13 years 3 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
100
Voted
SIAMDM
2008
15 years 16 days ago
2008
A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Houga...
90
Voted
COMBINATORICS
2004
15 years 13 days ago
2004
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing...
188
click to vote
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
Distributed and parallel computing environments are becoming cheap and commonplace. The availability of large numbers of CPU's makes it possible to process more data at highe...
97
Voted
ICALP
2009
Springer
16 years 27 days ago
2009
Springer
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...