3008 search results - page 91 / 602 » Independence in connected graphs |
185
click to vote
PARA
2004
Springer
15 years 11 months ago
2004
Springer
This paper gives a numerical algorithm able to compute the number of path-connected components of a set S defined by nonlinear inequalities. This algorithm uses interval analysis ...
136
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
Abstract. Rent's rule and related concepts of connectivity such as dimensionality, line-length distributions, and separators have found great use in fundamental studies of di ...
128
click to vote
WG
2000
Springer
15 years 10 months ago
2000
Springer
Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we address graph-theoretic problems t...
183
click to vote
IWPEC
2009
Springer
16 years 27 days ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
149
click to vote
AMTA
2000
Springer
15 years 10 months ago
2000
Springer
This paper describes a language independent linearization engine, oxyGen. This system compiles target language grammars into programs that take feature graphs as inputs and genera...