275 search results - page 45 / 55 » Bounding the Number of Edges in Permutation Graphs |
JCT
2007
13 years 7 months ago
2007
The codegree density γ(F) of an r-graph F is the largest number γ such that there are F-free r-graphs G on n vertices such that every set of r−1 vertices is contained in at le...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
ICRA
2003
IEEE
14 years 20 days ago
2003
IEEE
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
MST
2002
13 years 7 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
NETWORKS
2010
13 years 5 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...