4865 search results - page 218 / 973 » The Complexity of Graph Connectivity |
117
click to vote
DCG
2008
15 years 4 months ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
110
click to vote
DM
2006
15 years 3 months ago
2006
Given a 3-connected biased graph with three node-disjoint unbalanced circles, at most one of which is a loop, we describe how the bias matroid of is uniquely represented by .
140
click to vote
LATA
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
101
Voted
WG
1992
Springer
15 years 8 months ago
1992
Springer
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
108
Voted
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper we reveal a connection between the coefficients of the morphological wavelet transform and complexity measures of dyadic tree representations of level sets. This le...