Results 1  10
of
132
Languages Representable by Vertexlabeled Graphs
"... 1 Introduction A formal language is a set of finitelength words that can be specified in a great variety of ways and be associated with different combinatorial objects [2, 4, 6, 7]. For example we can consider a set of paths in a labeled graph that define a language in an alphabet of graph labels. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. Actually, different classes of labeled graphs can place different limitations on the languages that they represent. It is a well known fact that the necessary and sufficient condition for the language to be representable by finite edgelabeled graphs, is its regularity. The vertexlabeled graphs place
On Pseudo VertexMagic and EdgeMagic TotalLabellings
, 2001
"... To date the study of graph labellings has focused on finding classes of graphs which admit a particular type of labelling. Here we consider variations of the wellknown edgemagic and vertexmagic labellings for which all graphs admit such a labelling. In particular we consider two types of labellin ..."
Abstract
 Add to MetaCart
To date the study of graph labellings has focused on finding classes of graphs which admit a particular type of labelling. Here we consider variations of the wellknown edgemagic and vertexmagic labellings for which all graphs admit such a labelling. In particular we consider two types
On vertexmagic and edgemagic total injections of graphs
 AUSTRALAS J. COMBIN
, 2002
"... The study of graph labellings has focused on finding classes of graphs which admit a particular type of labelling. Here we consider variations of the wellknown edgemagic and vertexmagic total labellings for which all graphs admit such a labelling. In particular, we consider two types of injection ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
The study of graph labellings has focused on finding classes of graphs which admit a particular type of labelling. Here we consider variations of the wellknown edgemagic and vertexmagic total labellings for which all graphs admit such a labelling. In particular, we consider two types
Vertex Magic Total Labelings of Complete Graphs
"... A vertex magic total labeling of a graph G = (V;E) is a bijection f: V [ E! f1; 2; : : : ; jV j + jEjg such that for every vertex w; the sum f(w) + P uw2E f(uw) is a constant. It is well known that all complete graphs Kn admit a vertex magic total labeling. In this paper we present a new proof of t ..."
Abstract
 Add to MetaCart
A vertex magic total labeling of a graph G = (V;E) is a bijection f: V [ E! f1; 2; : : : ; jV j + jEjg such that for every vertex w; the sum f(w) + P uw2E f(uw) is a constant. It is well known that all complete graphs Kn admit a vertex magic total labeling. In this paper we present a new proof
Repairing Vertex Labels under Neighborhood Constraints
"... A broad class of data, ranging from similarity networks, workflow networks to protein networks, can be modeled as graphs with data values as vertex labels. The vertex labels (data values) are often dirty for various reasons such as typos or erroneous reporting of results in scientific experiments. N ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A broad class of data, ranging from similarity networks, workflow networks to protein networks, can be modeled as graphs with data values as vertex labels. The vertex labels (data values) are often dirty for various reasons such as typos or erroneous reporting of results in scientific experiments
A Coding Method for Efficient Subgraph Querying on Vertex and EdgeLabeled Graphs
, 2013
"... Labeled graphs are widely used to model complex data in many domains, so subgraph querying has been attracting more and more attention from researchers around the world. Unfortunately, subgraph querying is very time consuming since it involves subgraph isomorphism testing that is known to be an NPc ..."
Abstract
 Add to MetaCart
Labeled graphs are widely used to model complex data in many domains, so subgraph querying has been attracting more and more attention from researchers around the world. Unfortunately, subgraph querying is very time consuming since it involves subgraph isomorphism testing that is known to be an NP
Random planar lattices and integrated superBrownian excursion
 PROBAB. TH. REL. FIELDS
, 2002
"... In this paper, a surprising connection is described between a specific brand of random lattices, namely planar quadrangulations, and Aldous’ Integrated SuperBrownian Excursion (ISE). As a consequence, the radius rn of a random quadrangulation with n faces is shown to converge, up to scaling, to th ..."
Abstract

Cited by 93 (3 self)
 Add to MetaCart
. The first combinatorial ingredient is an encoding of quadrangulations by trees embedded in the positive halfline, reminiscent of Cori and Vauquelin’s well labelled trees. The second step relates these trees to embedded (discrete) trees in the sense of Aldous, via the conjugation of tree principle
Subexponential algorithms for Unique Games and related problems
 IN 51 ST IEEE FOCS
, 2010
"... We give subexponential time approximation algorithms for the unique games and the small set expansion problems. Specifically, for some absolute constant c, we give: 1. An exp(kn ε)time algorithm that, given as input a kalphabet unique game on n variables that has an assignment satisfying 1 − ε c f ..."
Abstract

Cited by 80 (7 self)
 Add to MetaCart
at most ε. We also obtain a subexponential algorithm with improved approximation for the MultiCut problem, as well as subexponential algorithms with improved approximations to MaxCut, SparsestCut and Vertex Cover on some interesting subclasses of instances. Khot’s Unique Games Conjecture (UGC) states
GREW—A Scalable Frequent Subgraph Discovery Algorithm
 in Fourth IEEE International Conference on Data Mining (ICDM 2004). 2004
, 2003
"... Existing algorithms that mine graph datasets to discover patterns corresponding to frequently occurring subgraphs can operate efficiently on graphs that are sparse, contain a large number of relatively small connected components, have vertices with low and bounded degrees, and contain welllabeled v ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
Existing algorithms that mine graph datasets to discover patterns corresponding to frequently occurring subgraphs can operate efficiently on graphs that are sparse, contain a large number of relatively small connected components, have vertices with low and bounded degrees, and contain welllabeled
Results 1  10
of
132