Sciweavers

5889 search results - page 147 / 1178
» Graph Layout Problems
Sort
View
SIGCSE
2000
ACM
120views Education» more  SIGCSE 2000»
15 years 9 months ago
PILOT: an interactive tool for learning and grading
We describe a Web-based interactive system, called PILOT, for testing computer science concepts. The strengths of PILOT are its universal access and platform independence, its use...
Stina S. Bridgeman, Michael T. Goodrich, Stephen G...
ICCAD
1996
IEEE
90views Hardware» more  ICCAD 1996»
15 years 8 months ago
A coloring approach to the structural diagnosis of interconnects
This paper presents a new approach for diagnosing stuck-at and short faults in interconnects whose layouts are known. This structural approach exploits dierent graph coloring and ...
Xiao-Tao Chen, Fabrizio Lombardi
GD
2006
Springer
15 years 8 months ago
Partitions of Graphs into Trees
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
Therese C. Biedl, Franz-Josef Brandenburg
DAM
1999
81views more  DAM 1999»
15 years 4 months ago
On the Extension of Bipartite to Parity Graphs
Parity graphs form a superclass of bipartite and distance-hereditary graphs. Since their introduction, all the algorithms proposed as solutions to the recognition problem and othe...
Serafino Cicerone, Gabriele Di Stefano
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
15 years 10 months ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara