1188 search results - page 128 / 238 » Extended Graph Unification |
178
click to vote
SIROCCO
1997
15 years 4 months ago
1997
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...
132
click to vote
EJC
2008
15 years 3 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
132
click to vote
IPL
2006
15 years 3 months ago
2006
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
125
click to vote
EOR
2007
15 years 3 months ago
2007
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
120
click to vote
RE
2002
Springer
15 years 2 months ago
2002
Springer
This paper presents an extended version of GoalOriented Requirements Analysis Method called AGORA, where attribute values, e.g. contribution values and preference matrices, are ad...