1149 search results - page 18 / 230 » Minimally non-Pfaffian graphs |
APPROX
2009
Springer
14 years 4 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
PAKDD
2004
ACM
14 years 3 months ago
2004
ACM
The use of unlabeled data to aid classification is important as labeled data is often available in limited quantity. Instead of utilizing training samples directly into semi-super...
ENDM
2008
13 years 9 months ago
2008
For a family F of graphs, a graph U is said to be F-universal if every graph of F is a subgraph of U. Similarly, a graph is said to be F-induced-universal if every graph of F is a...
ISPD
2000
ACM
14 years 2 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
SOFSEM
2005
Springer
14 years 3 months ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...