Sciweavers

1605 search results - page 132 / 321
» On Partitional Labelings of Graphs
Sort
View
JGT
2007
146views more  JGT 2007»
13 years 10 months ago
Compatible circuit decompositions of 4-regular graphs
A transition system T of an Eulerian graph G is a family of partitions of the edges incident to each vertex of G into transitions i.e. subsets of size two. A circuit decomposition...
Herbert Fleischner, François Genest, Bill J...
CORR
2004
Springer
111views Education» more  CORR 2004»
13 years 10 months ago
Layout of Graphs with Bounded Tree-Width
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum numb...
Vida Dujmovic, Pat Morin, David R. Wood
DM
1999
101views more  DM 1999»
13 years 10 months ago
Characterizations of bipartite Steinhaus graphs
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...
Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dym&ag...
WAW
2010
Springer
306views Algorithms» more  WAW 2010»
13 years 8 months ago
Finding and Visualizing Graph Clusters Using PageRank Optimization
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
Fan Chung Graham, Alexander Tsiatas
FLAIRS
2006
14 years 4 days ago
Inexact Graph Matching: A Case of Study
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
Ivan Olmos, Jesus A. Gonzalez, Mauricio Osorio