Sciweavers

2503 search results - page 303 / 501
» A study of 3-arc graphs
Sort
View
DM
2008
79views more  DM 2008»
15 years 6 months ago
The reconstruction conjecture and edge ideals
Given a simple graph G on n vertices, we prove that it is possible to reconstruct several algebraic properties of the edge ideal from the deck of G, that is, from the collection o...
Kia Dalili, Sara Faridi, Will Traves
JUCS
2007
117views more  JUCS 2007»
15 years 5 months ago
Connectivity and Reachability in Signed Networks
: For modeling real-life situations where not only the intensity of the relation existing between elements but also its polarity is important, we have proposed (see [Marcus and Tat...
Monica Tataram
APVIS
2007
15 years 7 months ago
A comparison of vertex ordering algorithms for large graph visualization
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...
VDA
2010
247views Visualization» more  VDA 2010»
15 years 8 months ago
Flow Web: a graph based user interface for 3D flow field exploration
While there have been intensive efforts in developing better 3D flow visualization techniques, little attention has been paid to the design of better user interfaces and more effe...
Lijie Xu, Han-Wei Shen
IPPS
1998
IEEE
15 years 10 months ago
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
Yu-Kwong Kwok, Ishfaq Ahmad