1097 search results - page 69 / 220 » Testing Graph Isomorphism |
ORL
2006
14 years 9 months ago
2006
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...
VLSID
2002
IEEE
15 years 10 months ago
2002
IEEE
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
GD
2006
Springer
15 years 1 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
JGAA
2007
14 years 9 months ago
2007
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
WG
2005
Springer
15 years 3 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...