Sciweavers

3757 search results - page 423 / 752
» The overlap number of a graph
Sort
View
EUSFLAT
2003
161views Fuzzy Logic» more  EUSFLAT 2003»
15 years 8 months ago
Fuzzy interpolation and level 2 gradual rules
Functional laws may be known only at a finite number of points, and then the function can be completed by interpolation techniques obeying some smoothness conditions. We rather pr...
Sylvie Galichet, Didier Dubois, Henri Prade
PUK
2003
15 years 8 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
SIROCCO
1997
15 years 8 months ago
Static Frequency Assignment in Cellular Networks
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
Lata Narayanan, Sunil M. Shende
SODA
1996
ACM
95views Algorithms» more  SODA 1996»
15 years 8 months ago
RNC Algorithms for the Uniform Generation of Combinatorial Structures
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 6 months ago
Complexity dichotomy on partial grid recognition
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
Vinícius G. P. de Sá, Guilherme Dias...