2314 search results - page 155 / 463 » Minimal Partitions of a Graph |
119
Voted
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
We provide a certifying algorithm for the problem of deciding whether a P5-free graph is 3-colorable by showing there are exactly six finite graphs that are P5-free and not 3-colo...
125
click to vote
JSSPP
2009
Springer
15 years 10 months ago
2009
Springer
The number of applications with many parallel cooperating processes is steadily increasing, and developing efficient runtimes for their execution is an important task. Several fram...
131
Voted
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...
129
Voted
ICPR
2010
IEEE
15 years 8 months ago
2010
IEEE
—In this paper, we propose a Multi-Manifold Discriminant Analysis (MMDA) method for face feature extraction and face recognition, which is based on graph embedded learning and un...
135
click to vote
PPL
2000
15 years 3 months ago
2000
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...