Results 1  10
of
116,674
Forbidden subgraphs in connected graphs
, 2004
"... Given a set ξ = {H1,H2, · · ·} of connected non acyclic graphs, a ξfree graph is one which does not contain any member of ξ as copy. Define the excess of a graph as the difference between its number of edges and its number of vertices. Let Wk,ξ be theexponential generating function (EGF for brie ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Given a set ξ = {H1,H2, · · ·} of connected non acyclic graphs, a ξfree graph is one which does not contain any member of ξ as copy. Define the excess of a graph as the difference between its number of edges and its number of vertices. Let Wk,ξ be theexponential generating function (EGF
Forbidden subgraphs and the . . .
, 2013
"... The matching number of a graph is the maximum size of a set of vertexdisjoint edges. The transversal number is the minimum number of vertices needed to meet every edge. A graph has the KönigEgerváry property if its matching number equals its transversal number. Lovász proved a characterization of g ..."
Abstract
 Add to MetaCart
of graphs having the KönigEgerváry property by means of forbidden subgraphs within graphs with a perfect matching. Korach, Nguyen, and Peis proposed an extension of Lovász’s result to a characterization of all graphs having the KönigEgerváry property in terms of forbidden configurations (which are certain
Frequent Subgraph Discovery
, 2001
"... Over the years, frequent itemset discovery algorithms have been used to solve various interesting problems. As data mining techniques are being increasingly applied to nontraditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the requirement of th ..."
Abstract

Cited by 407 (14 self)
 Add to MetaCart
of these domains. An alternate way of modeling the objects in these data sets, is to use a graph to model the database objects. Within that model, the problem of finding frequent patterns becomes that of discovering subgraphs that occur frequently over the entire set of graphs. In this paper we present a
Property Testing and its connection to Learning and Approximation
"... We study the question of determining whether an unknown function has a particular property or is fflfar from any function with that property. A property testing algorithm is given a sample of the value of the function on instances drawn according to some distribution, and possibly may query the fun ..."
Abstract

Cited by 498 (68 self)
 Add to MetaCart
the function on instances of its choice. First, we establish some connections between property testing and problems in learning theory. Next, we focus on testing graph properties, and devise algorithms to test whether a graph has properties such as being kcolorable or having a aeclique (clique of density ae
gSpan: GraphBased Substructure Pattern Mining
, 2002
"... We investigate new approaches for frequent graphbased pattern mining in graph datasets and propose a novel algorithm called gSpan (graphbased Substructure pattern mining) , which discovers frequent substructures without candidate generation. gSpan builds a new lexicographic order among graphs, and ..."
Abstract

Cited by 639 (34 self)
 Add to MetaCart
, and maps each graph to a unique minimum DFS code as its canonical label. Based on this lexicographic order, gSpan adopts the depthfirst search strategy to mine frequent connected subgraphs efficiently. Our performance study shows that gSpan substantially outperforms previous algorithms, sometimes
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 627 (44 self)
 Add to MetaCart
Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized
Results 1  10
of
116,674