Sciweavers

253 search results - page 10 / 51
» Testing subgraphs in directed graphs
Sort
View
ISAAC
1995
Springer
97views Algorithms» more  ISAAC 1995»
14 years 1 months ago
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
Wen-Lian Hsu
APSCC
2009
IEEE
14 years 4 months ago
Modeling and testing of cloud applications
What is a cloud application precisely? In this paper, we formulate a computing cloud as a kind of graph, a computing resource such as services or intellectual property access righ...
W. K. Chan, Lijun Mei, Zhenyu Zhang
TCS
2002
13 years 9 months ago
Streams and strings in formal proofs
Streams are acyclic directed subgraphs of the logical ow graph of a proof representing bundles of paths with the same origin and the same end. The notion of stream is used to desc...
Alessandra Carbone
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
14 years 10 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
GD
2004
Springer
14 years 3 months ago
QUOGGLES: Query On Graphs - A Graphical Largely Extensible System
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
Paul Holleis, Franz-Josef Brandenburg