Sciweavers

11 search results - page 1 / 3
» Paths and trails in edge-colored graphs
Sort
View
COLOGNETWENTE
2009
13 years 5 months ago
Colored Trees in Edge-Colored Graphs
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
A. Abouelaoualim, V. Borozan, Yannis Manoussakis, ...
TCS
2008
13 years 4 months ago
Paths and trails in edge-colored graphs
This paper deals with the existence and search of properly edgecolored paths/trails between two, not necessarily distinct, vertices s and t in an edge-colored graph from an algori...
A. Abouelaoualim, Kinkar Chandra Das, L. Faria, Ya...
EDM
2008
113views Data Mining» more  EDM 2008»
13 years 5 months ago
Mining and Visualizing Visited Trails in Web-Based Educational Systems
A data mining and visualization tool for the discovery of student trails in web-based educational systems is presented and described. The tool uses graphs to visualize results, all...
Cristóbal Romero, Sergio Gutiérrez S...
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
13 years 4 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...