Sciweavers

6598 search results - page 95 / 1320
» Graph Theory with Applications
Sort
View
CORR
2011
Springer
165views Education» more  CORR 2011»
14 years 8 months ago
Data Base Mappings and Theory of Sketches
In this paper we will present the two basic operations for database schemas used in database mapping systems (separation and Data Federation), and we will explain why the functoria...
Zoran Majkic
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 8 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
16 years 4 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
SECURWARE
2008
IEEE
15 years 10 months ago
Optimal Trust Network Analysis with Subjective Logic
Trust network analysis with subjective logic (TNA-SL) simplifies complex trust graphs into series-parallel graphs by removing the most uncertain paths to obtain a canonical graph...
Audun Jøsang, Touhid Bhuiyan
VISSOFT
2005
IEEE
15 years 10 months ago
The Dominance Tree in Visualizing Software Dependencies
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...
Raimar Falke, Raimund Klein, Rainer Koschke, Joche...