Sciweavers

9532 search results - page 315 / 1907
» Logic, Graphs, and Algorithms
Sort
View
148
Voted
ASPDAC
2001
ACM
82views Hardware» more  ASPDAC 2001»
15 years 10 months ago
Towards the logic defect diagnosis for partial-scan designs
Loical defect diagnosis is a critical yet challenging process in VLSI manufacturing. It involves the identification of the defect spots in a logic IC that fails testing. In the la...
Shi-Yu Huang
AAAI
1996
15 years 8 months ago
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Kalev Kask, Rina Dechter
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 7 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
DM
2008
123views more  DM 2008»
15 years 6 months ago
Graphic sequences with a realization containing a generalized friendship graph
: Gould, Jacobson and Lehel (Combinatorics, Graph Theory and Algorithms, Vol.I (1999) 451
Jian-Hua Yin, Gang Chen, John R. Schmitt
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
15 years 5 months ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou