1105 search results - page 5 / 221 » Linear choosability of graphs |
SODA
2012
ACM
13 years 1 days ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
ACCV
2010
Springer
14 years 4 months ago
2010
Springer
The Viewing Graph [1] represents several views linked by the corresponding fundamental matrices, estimated pairwise. Given a Viewing Graph, the tuples of consistent camera matrices...
ICDAR
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
CORR
2009
Springer
14 years 7 months ago
2009
Springer
111
click to vote
IPL
2007
14 years 9 months ago
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...