Sciweavers

1097 search results - page 40 / 220
» Testing Graph Isomorphism
Sort
View
ICDM
2008
IEEE
120views Data Mining» more  ICDM 2008»
15 years 4 months ago
Anti-monotonic Overlap-Graph Support Measures
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
Toon Calders, Jan Ramon, Dries Van Dyck
ECCC
2006
70views more  ECCC 2006»
14 years 9 months ago
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
Artur Czumaj, Andrzej Lingas
COCO
2004
Springer
93views Algorithms» more  COCO 2004»
15 years 3 months ago
Lower Bounds for Testing Bipartiteness in Dense Graphs
We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and g...
Andrej Bogdanov, Luca Trevisan
SEDE
2010
14 years 7 months ago
On Software Test Estimate and Requirement Tracking
Test is a key activity for ensuring software quality. There is always pressure from project sponsor and management for software development team to commit to shorter schedule and ...
Jing-Chiou Liou
CODES
2005
IEEE
15 years 3 months ago
An integer linear programming approach for identifying instruction-set extensions
This paper presents an Integer Linear Programming (ILP) approach to the instruction-set extension identification problem. An algorithm that iteratively generates and solves a set...
Kubilay Atasu, Günhan Dündar, Can C. &Ou...