1485 search results - page 13 / 297 » connection 2010 |
125
click to vote
DM
2010
15 years 3 months ago
2010
We characterize all internally 4-connected binary matroids M with the property that the ground set of M can be ordered (e0, . . . , en-1) in such a way that {ei, . . . , ei+t} is 4...
DM
2010
15 years 3 months ago
2010
Let G be a connected graph, suppose that v is a vertex of G, and denote the subgraph formed from G by deleting vertex v by G \ v. Denote the algebraic connectivities of G and G \ ...
122
click to vote
CGF
2010
15 years 3 months ago
2010
This paper presents a straightforward algorithm for constructing connections on discrete surfaces that are as smooth as possible everywhere but on a set of isolated singularities ...
112
click to vote
ENDM
2007
15 years 3 months ago
2007
Fix a family T of 3-connected graphs, and let G be the class of graphs whose 3connected components are the graphs in T . We present a general framework for analyzing such graph cl...
132
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper studies the connectivity maintenance problem in linear and nonlinear cyclic pursuit, when different control gains are assigned to each agent. Feasibility/infeasibility c...