Results 1  10
of
2,740
Node Labeling
, 1997
"... This document describes a scheme for labeling a program dependence graph (PDG) or control flow graph (CFG) in order to codify the hierarchical control dependence structure of a procedure. The first section describes the scheme and its features. Section 2 provides some applications for the labels. Se ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This document describes a scheme for labeling a program dependence graph (PDG) or control flow graph (CFG) in order to codify the hierarchical control dependence structure of a procedure. The first section describes the scheme and its features. Section 2 provides some applications for the labels
Node Labeling
, 1997
"... This document describes a scheme for labeling a program dependence graph (PDG) or control flow graph (CFG) in order to codify the hierarchical control dependence structure of a procedure. The first section describes the scheme and its features. Section 2 provides some applications for the labels. Se ..."
Abstract
 Add to MetaCart
This document describes a scheme for labeling a program dependence graph (PDG) or control flow graph (CFG) in order to codify the hierarchical control dependence structure of a procedure. The first section describes the scheme and its features. Section 2 provides some applications for the labels
Node Labels in Local Decision
"... Abstract. The role of unique node identifiers in network computing is well understood as far as symmetry breaking is concerned. However, the unique identifiers also leak information about the computing environment—in particular, they provide some nodes with information related to the size of the net ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
we give study what is the minimal amount of information that we need to leak from the environment to the nodes in order to solve local decision problems. Our key results are related to scalar oracles f that, for any given n, provide a multiset f(n) of n labels; then the adversary assigns the labels
Graph Decomposition Using Node Labels
 ROYAL INSTITUTE OF TECHNOLOGY
, 2001
"... Dynamic programming is a method in which the solution to a computational problem is found by combination of already obtained solutions to subproblems. This method can be applied to problems on graphs (nodes connected by edges). The graph of interest must then be broken down into successively smaller ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
smaller parts according to some suitable principle. The thesis studies two graph algebras introduced for this purpose (Wanke 1994; Courcelle and Olariu 1994). Nodes have labels, and roughly, the operations are union, edge drawing, and relabeling. Once two nodes have acquired the same label, they can
EBSL: Supporting Deleted Node Label Reuse in XML?
"... Abstract. Recently, there has been much research into the specification of dynamic labeling schemes supporting XML updates. The primary design goal of any dynamic labeling scheme is to limit the growth rate in node label size, and consequently increase query performance and reduce update costs. The ..."
Abstract
 Add to MetaCart
Abstract. Recently, there has been much research into the specification of dynamic labeling schemes supporting XML updates. The primary design goal of any dynamic labeling scheme is to limit the growth rate in node label size, and consequently increase query performance and reduce update costs
Graffiti: Node Labeling in Heterogeneous Networks
"... We introduce a multilabel classification model and algorithm for labeling heterogeneous networks, where nodes belong to different types and different types have different sets of classification labels. We present a graphbased approach which models the mutual influence between nodes in the network ..."
Abstract
 Add to MetaCart
We introduce a multilabel classification model and algorithm for labeling heterogeneous networks, where nodes belong to different types and different types have different sets of classification labels. We present a graphbased approach which models the mutual influence between nodes in the network
Induction of node label controlled graph grammar rules
 In Proceedings of the 6th International Workshop on Mining and Learning with Graphs
, 2008
"... Algorithms for inducing graph grammars from sets of graphs have been proposed before. An important class of such algorithms are those based on the Subdue graph mining system. But the rules learned by Subdue and its derivatives do not fit easily in any of the wellstudied graph grammars formalisms. I ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
. In this paper, we discuss how Subduelike algorithms could be made to work in the context of NLC grammars, an important class of node replacement graph grammars. More specifically, we show how, given a set of occurrences of a subgraph, an NLC grammar rule can be induced such that the given occurrences could
ORDPATHs: InsertFriendly XML Node Labels
"... We introduce a hierarchical labeling scheme called ORDPATH that is implemented in the upcoming version of Microsoft ® SQL Server™. ORDPATH labels nodes of an XML tree without requiring a schema (the most general case—a schema simplifies the problem). An example of an ORDPATH value display format is ..."
Abstract
 Add to MetaCart
We introduce a hierarchical labeling scheme called ORDPATH that is implemented in the upcoming version of Microsoft ® SQL Server™. ORDPATH labels nodes of an XML tree without requiring a schema (the most general case—a schema simplifies the problem). An example of an ORDPATH value display format
Lineartime algorithms for encoding trees as sequences of node labels
, 2007
"... In this paper we present O(n)time algorithms for encoding/decoding nnode labeled trees as sequences of n − 2 node labels. All known encodings of this type are covered, including Prüferlike codes and the three codes proposed by Picciotto the happy, blob, and dandelion codes. The algorithms for Pi ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
In this paper we present O(n)time algorithms for encoding/decoding nnode labeled trees as sequences of n − 2 node labels. All known encodings of this type are covered, including Prüferlike codes and the three codes proposed by Picciotto the happy, blob, and dandelion codes. The algorithms
ORDPATHs: InsertFriendly XML Node Labels
"... Work of these authors was performed at Microsoft, while on ..."
Results 1  10
of
2,740