5473 search results - page 242 / 1095 » On the graph isomorphism problem |
203
click to vote
IPCO
2008
15 years 8 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
208
click to vote
IEE
2008
15 years 7 months ago
2008
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
159
click to vote
COMBINATORICS
2000
15 years 7 months ago
2000
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 2ti. A Meeussen sequence is an increasing sequence of positive inte...
191
click to vote
COMBINATORICS
2002
15 years 7 months ago
2002
The directed anti-Oberwolfach problem asks for a 2-factorization (each factor has in-degree 1 and out-degree 1 for a total degree of two) of K2n+1, not with consistent cycle compo...
201
click to vote
VIZSEC
2005
Springer
16 years 22 days ago
2005
Springer
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...