Article

Free access

Addressable data graphs (Extended Abstract)

Author:

Arnold L. RosenbergAuthors Info & Claims

STOC '71: Proceedings of the third annual ACM symposium on Theory of computing

Pages 138 - 150

https://doi.org/10.1145/800157.805046

Published: 03 May 1971 Publication History

PDF eReader

Abstract

This paper continues the study of the classes of data graphs which are implementable in a random access memory using “relative addressing” and “relocatable realization”, which was initiated in [1]. A new characterization of the class of rooted (=relative addressable) data graphs yields simple and natural proofs of the preservation of rootedness under broad families of operations for composing data graphs. These positive results somewhat diminish the impact of the general unsolvability of detecting rootedness and free-rootedness (=relocatability) in data graphs.

Reference

[1]

Rosenberg, A. L. Data graphs and addressing schemes. Journ. Computer and System Sciences, in press. See also a preliminary version in Proc. 2nd Annual ACM Symposium on Theory of Computing, Northampton, Mass. (1970) 48-61.

Digital Library

Google Scholar

Index Terms

Addressable data graphs (Extended Abstract)
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

Restrained domination and its variants in extended supergrid graphs
Abstract
Domination problem is a well-known NP-complete problem for general graphs. In this paper, we will study its three variants, including restrained, independent restrained, and restrained-step dominations. A restrained dominating set of a ...
Highlights
- Extended supergrid graphs can be applied to computerized sewing machine, 3D printers, and so on.
On semi-transitivity of (extended) Mycielski graphs
Abstract
An orientation of a graph is semi-transitive if it is acyclic and shortcut-free. An undirected graph is semi-transitive if it admits a semi-transitive orientation. Semi-transitive graphs generalise several important classes of graphs and they are ...
The 2-Rainbow Domination of Sierpiński Graphs and Extended Sierpiński Graphs

Let G(V, E) be a connected and undirected graph with n-vertex-set V and m-edge-set E. For each v ź V, let N(v) = {u|v ź V and(u, v) ź E}. For a positive integer k, a k-rainbow dominating function of a graph G is a function f from V(G) to a k-bit Boolean ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

STOC '71: Proceedings of the third annual ACM symposium on Theory of computing

May 1971

270 pages

ISBN:9781450374644

DOI:10.1145/800157

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 May 1971

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

STOC '71 Paper Acceptance Rate 23 of 50 submissions, 46%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
284
Total Downloads

Downloads (Last 12 months)67
Downloads (Last 6 weeks)13

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

Restrained domination and its variants in extended supergrid graphs

On semi-transitivity of (extended) Mycielski graphs

The 2-Rainbow Domination of Sierpiński Graphs and Extended Sierpiński Graphs