2503 search results - page 9 / 501 » A study of 3-arc graphs |
127
click to vote
WG
2001
Springer
15 years 8 months ago
2001
Springer
We call an edge e of a perfect graph G critical if G − e is imperfect and say further that e is anticritical with respect to the complementary graph G. We ask in which perfect gr...
123
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has bee...
123
click to vote
IJON
2010
15 years 2 months ago
2010
This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure prod...
154
click to vote
IV
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
117
click to vote
SPAA
2000
ACM
15 years 8 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...