3267 search results - page 133 / 654 » Generalized quasirandom graphs |
136
click to vote
APPML
2007
15 years 4 months ago
2007
-An edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or to all of the perfect matchings of H. It is shown that a connected plane bipartite gra...
121
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...
122
click to vote
ACISICIS
2005
IEEE
15 years 6 months ago
2005
IEEE
This paper introduces a strategy and its theory proof to transform non-linear concept graph: Directed Acyclic Concept Graph (DACG) into a linear concept tree. The transformation i...
118
click to vote
JGAA
2006
15 years 4 months ago
2006
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
156
Voted
JALC
2002
15 years 4 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...