4201 search results - page 182 / 841 » Interaction graphs: Additives |
148
click to vote
WEA
2007
Springer
15 years 11 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
153
click to vote
ICDM
2006
IEEE
15 years 11 months ago
2006
IEEE
Mining graph data is an increasingly popular challenge, which has practical applications in many areas, including molecular substructure discovery, web link analysis, fraud detect...
164
click to vote
PDP
2005
IEEE
15 years 10 months ago
2005
IEEE
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
130
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
154
click to vote
DAC
2009
ACM
15 years 9 months ago
2009
ACM
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...