9532 search results - page 65 / 1907 » Logic, Graphs, and Algorithms |
138
click to vote
IPL
2000
15 years 4 months ago
2000
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
146
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
150
click to vote
UAI
2008
15 years 5 months ago
2008
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
158
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
144
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...