Sciweavers

5100 search results - page 75 / 1020
» The Linear Complexity of a Graph
Sort
View
ENDM
2008
90views more  ENDM 2008»
13 years 8 months ago
On cliques of Helly Circular-arc Graphs
A circular-arc graph is the intersection graph of a set of arcs on the circle. It is a Helly circular-arc graph if it has a Helly model, where every maximal clique is the set of a...
Min Chih Lin, Ross M. McConnell, Francisco J. Soul...
PODS
2005
ACM
118views Database» more  PODS 2005»
14 years 8 months ago
On the complexity of division and set joins in the relational algebra
We show that any expression of the relational division operator in the relational algebra with union, difference, projection, selection, constant-tagging, and joins, must produce ...
Dirk Leinders, Jan Van den Bussche
ANTS
1994
Springer
92views Algorithms» more  ANTS 1994»
14 years 1 days ago
The complexity of greatest common divisor computations
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
Bohdan S. Majewski, George Havas
WEA
2009
Springer
126views Algorithms» more  WEA 2009»
14 years 2 months ago
Measuring the Similarity of Geometric Graphs
What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer li...
Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, ...
ICCS
2004
Springer
14 years 1 months ago
Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
Hyunseung Choo, Vladimir V. Shakhov