1149 search results - page 13 / 230 » Minimally non-Pfaffian graphs |
COCOON
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k.
KDD
2009
ACM
14 years 9 months ago
2009
ACM
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
SPDP
1991
IEEE
13 years 12 months ago
1991
IEEE
This paper presents several techniques for adding fault-tolerance to distributed memory parallel computers. More formally, given a target graph with n nodes, we create a fault-tol...
APVIS
2004
13 years 9 months ago
2004
Visualizing information whose underlying graph is directed acyclic is easier if the graph is Minimal Vertex Series Parallel (MVSP). We present method of transforming any directed ...