Sciweavers

990 search results - page 98 / 198
» Sub-Graphs of Complete Graph
Sort
View
GD
2000
Springer
14 years 18 days ago
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
Therese C. Biedl, Torsten Thiele, David R. Wood
ACSAC
2009
IEEE
14 years 3 months ago
Modeling Modern Network Attacks and Countermeasures Using Attack Graphs
Abstract—By accurately measuring risk for enterprise networks, attack graphs allow network defenders to understand the most critical threats and select the most effective counter...
Kyle Ingols, Matthew Chu, Richard Lippmann, Seth E...
SIBGRAPI
2008
IEEE
14 years 3 months ago
Structural Matching of 2D Electrophoresis Gels using Graph Models
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
Alexandre Noma, Alvaro Pardo, Roberto Marcondes Ce...
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
14 years 3 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
CPC
2007
97views more  CPC 2007»
13 years 9 months ago
On an Online Spanning Tree Problem in Randomly Weighted Graphs
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
Jan Remy, Alexander Souza, Angelika Steger