473 search results - page 12 / 95 » Computing excluded minors |
SIAMCOMP
2010
13 years 5 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
MFCS
1998
Springer
13 years 11 months ago
1998
Springer
We develop a control flow analysis for the Imperative Object Calculus. We prove the correctness with respect to two Structural Operational Semantics that differ in minor technical ...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
SODA
2012
ACM
11 years 9 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 ...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
The class imbalance is a critical problem in classification tasks related to many real world applications. A large number of solutions were proposed in literature, both at the al...