Sciweavers

5473 search results - page 660 / 1095
» On the graph isomorphism problem
Sort
View
COCOON
2006
Springer
15 years 10 months ago
Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...
Jesper Torp Kristensen, Peter Bro Miltersen
APAQS
2001
IEEE
15 years 10 months ago
Object-Oriented Program Behavior Analysis Based on Control Patterns
Code-patterns are statically recurring structure specific to a programming language. It can be parallel to aid in designing software systems for solving particular problems. Contr...
C.-C. Hwang, S.-K. Huang, D.-J. Chen, D. Chen
CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
15 years 10 months ago
Capacitated Confluent Flows: Complexity and Algorithms
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
Daniel Dressler and Martin Strehler
ICPR
2010
IEEE
15 years 9 months ago
Using Spatial Relations for Graphical Symbol Description
—In this paper, we address the use of unified spatial relations for symbol description. We present a topologically guided directional relation signature. It references a unique ...
Santosh K. C., Laurent Wendling, Bart Lamiroy
ICC
2007
IEEE
157views Communications» more  ICC 2007»
15 years 8 months ago
On the Effectiveness of the 2-hop Routing Strategy in Mobile Ad Hoc Networks
— In this paper, we study the performance of the 2-hop routing scheme proposed for ad hoc wireless networks with mobile nodes, considering realistic node mobility patterns. First...
Michele Garetto, Paolo Giaccone, Emilio Leonardi