Sciweavers

620 search results - page 47 / 124
» The edge-flipping group of a graph
Sort
View
SOFTVIS
2006
ACM
14 years 2 months ago
Semantic web data visualization with graph style sheets
Visual paradigms such as node-link diagrams are well suited to the representation of Semantic Web data encoded with the Resource Description Framework (RDF), whose data model can ...
Emmanuel Pietriga
GD
2005
Springer
14 years 2 months ago
Energy-Based Clustering of Graphs with Nonuniform Degrees
Widely varying node degrees occur in software dependency graphs, hyperlink structures, social networks, and many other real-world graphs. Finding dense subgraphs in such graphs is ...
Andreas Noack
ICPADS
1998
IEEE
14 years 1 months ago
Symbolic Partitioning and Scheduling of Parameterized Task Graphs
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
FCT
2005
Springer
14 years 2 months ago
Reconstructing Many Partitions Using Spectral Techniques
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
Joachim Giesen, Dieter Mitsche
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
14 years 2 months ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Shmuel Safra, Oded Schwartz