1149 search results - page 61 / 230 » Minimally non-Pfaffian graphs |
JCO
2010
14 years 10 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
119
click to vote
COLT
2010
Springer
14 years 10 months ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
105
click to vote
ICTAI
2010
IEEE
14 years 9 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
122
click to vote
TIP
2011
14 years 6 months ago
2011
Abstract—The purpose of this study is to investigate multiregion graph cut image partitioning via kernel mapping of the image data. The image data is transformed implicitly by a ...
133
click to vote
APVIS
2011
13 years 12 months ago
2011
Graphs are often used to encapsulate relationships between objects. Node-link diagrams, commonly used to visualize graphs, suffer from visual clutter on large graphs. Edge bundlin...