5473 search results - page 121 / 1095 » On the graph isomorphism problem |
144
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Given an undirected graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtai...
172
click to vote
ACSC
2005
IEEE
16 years 16 hour ago
2005
IEEE
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
180
click to vote
DAM
2008
15 years 6 months ago
2008
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
176
click to vote
FSTTCS
2005
Springer
15 years 12 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
148
click to vote
DAM
2007
15 years 6 months ago
2007
: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...