Results 1  10
of
491
SelfApproaching Graphs
"... In this paper we introduce selfapproaching graph drawings. A straightline drawing of a graph is selfapproaching if, for any origin vertex s and any destination vertex t, there is an stpath in the graph such that, for any point q on the path, as a point p moves continuously along the path from ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper we introduce selfapproaching graph drawings. A straightline drawing of a graph is selfapproaching if, for any origin vertex s and any destination vertex t, there is an stpath in the graph such that, for any point q on the path, as a point p moves continuously along the path from
On selfapproaching and increasingchord drawings of 3connected planar graphs
 International Symposium on Graph Drawing (GD ’14
, 2014
"... An stpath in a drawing of a graph is selfapproaching if during the traversal of the corresponding curve from s to any point t ′ on the curve the distance to t′ is nonincreasing. A path has increasing chords if it is selfapproaching in both directions. A drawing is selfapproaching (increasingch ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
An stpath in a drawing of a graph is selfapproaching if during the traversal of the corresponding curve from s to any point t ′ on the curve the distance to t′ is nonincreasing. A path has increasing chords if it is selfapproaching in both directions. A drawing is selfapproaching (increasing
Impact of similarity measures on webpage clustering,”
 in Workshop on Artificial Intelligence for Web Search (AAAI
, 2000
"... Abstract Clustering of web documents enables (semi)automated categorization, and facilitates certain types of search. Any clustering method has to embed the documents in a suitable similarity space. While several clustering methods and the associated similarity measures have been proposed in the p ..."
Abstract

Cited by 205 (26 self)
 Add to MetaCart
useful criteria for comparisons across similarity metrics is indeed available. We then compare four popular similarity measures (Euclidean, cosine, Pearson correlation and extended Jaccard) in conjunction with several clustering techniques (random, selforganizing feature map, hypergraph partitioning
Towards a theory of scalefree graphs: Definition, properties, and implications
 Internet Mathematics
, 2005
"... Abstract. There is a large, popular, and growing literature on “scalefree ” networks with the Internet along with metabolic networks representing perhaps the canonical examples. While this has in many ways reinvigorated graph theory, there is unfortunately no consistent, precise definition of scale ..."
Abstract

Cited by 137 (12 self)
 Add to MetaCart
properties of SF graphs and provides one possible measure of the extent to which a graph is scalefree. This structural view can be related to previously studied graph properties such as the various notions of selfsimilarity, likelihood, betweenness and assortativity. Our approach clarifies much
Complete mining of frequent patterns from graphs: Mining graph data
 MACHINE LEARNING
, 2003
"... Basket Analysis, which is a standard method for data mining, derives frequent itemsets from database. However, its mining ability is limited to transaction data consisting of items. In reality, there are many applications where data are described in a more structural way, e.g. chemical compounds and ..."
Abstract

Cited by 100 (5 self)
 Add to MetaCart
and Web browsing history. There are a few approaches that can discover characteristic patterns from graphstructured data in the field of machine learning. However, almost all of them are not suitable for such applications that require a complete search for all frequent subgraph patterns in the data
ForceDirected Edge Bundling for Graph Visualization
, 2009
"... Graphs depicted as nodelink diagrams are widely used to show relationships between entities. However, nodelink diagrams comprised of a large number of nodes and edges often suffer from visual clutter. The use of edge bundling remedies this and reveals highlevel edge patterns. Previous methods requ ..."
Abstract

Cited by 81 (1 self)
 Add to MetaCart
require the graph to contain a hierarchy for this, or they construct a control mesh to guide the edge bundling process, which often results in bundles that show considerable variation in curvature along the overall bundle direction. We present a new edge bundling method that uses a self
A Graph Grammar Approach to SelfOrganizing Robots in Geometric Formations
"... Abstract—A graph grammar approach that may be used for the distributed assembling of geometric formations of robots is presented in this paper. The focus is on the synthesis of binary graph grammars, that is, sets of rules involving at most two robots, which give the assembly steps for unorganized ..."
Abstract
 Add to MetaCart
Abstract—A graph grammar approach that may be used for the distributed assembling of geometric formations of robots is presented in this paper. The focus is on the synthesis of binary graph grammars, that is, sets of rules involving at most two robots, which give the assembly steps
A Graph Coloring Approach for Scheduling Undo Actions in SelfOrganizing Networks,”
 in 2015 IFIP/IEEE International Symposium on Integrated Network Management (IM),
, 2015
"... AbstractIn a mobile SelfOrganizing Network (SON) a coordinator is necessary to avoid the execution of conflicting SON function instances. Typically, such a coordinator bases its decision to accept or reject a network parameter change request on a rule set that considers only known conflicts. More ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
of such undo actions that uses minimum graph coloring in order to identify the sets of cells whose configuration can be safely rolled back. Our evaluation is split in two parts. In the first part we highlight the importance of our approach by observing a real Long Term Evolution (LTE) network. The second part
Graph Exploration
"... acks on the just visited edge and is then lead to the third node. In any case, the triangle edges must be traversed twice to reach all the nodes again (we still must explore the selfloops). Note that our graph G is Eulerian (because each node has even degree), i.e., there exists a tour in G visiti ..."
Abstract
 Add to MetaCart
acks on the just visited edge and is then lead to the third node. In any case, the triangle edges must be traversed twice to reach all the nodes again (we still must explore the selfloops). Note that our graph G is Eulerian (because each node has even degree), i.e., there exists a tour in G
Results 1  10
of
491