Results 11  20
of
1,788
Efficient planarity testing
 J. ASSOC. COMPUT. MACH
, 1974
"... This paper describes an efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane. The algorithm may be viewed as an iterative version of a method originally proposed by Auslander and Parter and correctly formulated by Goldstein. The algorithm uses depthfirst sear ..."
Abstract

Cited by 281 (5 self)
 Add to MetaCart
This paper describes an efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane. The algorithm may be viewed as an iterative version of a method originally proposed by Auslander and Parter and correctly formulated by Goldstein. The algorithm uses depthfirst search and has O(V) time and space bounds, where V is the number of vertices in G. An ALGOS implementation of the algorithm successfully tested graphs with as many as 900 vertices in less than 12 seconds.
The NPcompleteness column: an ongoing guide
 JOURNAL OF ALGORITHMS
, 1987
"... This is the nineteenth edition of a (usually) quarterly column that covers new developments in the theory of NPcompleteness. The presentation is modeled on that used by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NPCompleteness," W. H. Freem ..."
Abstract

Cited by 243 (0 self)
 Add to MetaCart
(Show Context)
This is the nineteenth edition of a (usually) quarterly column that covers new developments in the theory of NPcompleteness. The presentation is modeled on that used by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NPCompleteness," W. H. Freeman & Co., New York, 1979 (hereinafter referred to as "[G&J]"; previous columns will be referred to by their dates). A background equivalent to that provided by [G&J] is assumed, and, when appropriate, crossreferences will be given to that book and the list of problems (NPcomplete and harder) presented there. Readers who have results they would like mentioned (NPhardness, PSPACEhardness, polynomialtimesolvability, etc.) or open problems they would like publicized, should
Matching Hierarchical Structures Using Association Graphs
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1998
"... this article, please send email to: tpami@computer.org, and reference IEEECS Log Number 108453 ..."
Abstract

Cited by 217 (27 self)
 Add to MetaCart
(Show Context)
this article, please send email to: tpami@computer.org, and reference IEEECS Log Number 108453
A Relational View of Information Seeking and Learning in Social Networks
, 2003
"... Research in organizational learning has demonstrated processes and occasionally performance implications of acquisition of declarative (knowwhat) and procedural (knowhow) knowledge. However, considerably less attention has been paid to learned characteristics of relationships that affect the decis ..."
Abstract

Cited by 185 (6 self)
 Add to MetaCart
Research in organizational learning has demonstrated processes and occasionally performance implications of acquisition of declarative (knowwhat) and procedural (knowhow) knowledge. However, considerably less attention has been paid to learned characteristics of relationships that affect the decision to seek information from other people. Based on a review of the social network, information processing, and organizational learning literatures, along with the results of a previous qualitative study, we propose a formal model of information seeking in which the probability of seeking information from another person is a function of (1) knowing what that person knows; (2) valuing what that person knows; (3) being able to gain timely access to that person’s thinking; and (4) perceiving that seeking information from that person would not be too costly. We also hypothesize that the knowing, access, and cost variables mediate the relationship between physical proximity and information seeking. The model is tested using two separate research sites to provide replication. The results indicate strong support for the model and the mediation hypothesis (with the exception of the cost variable). Implications are drawn for the study of both transactive memory and organizational learning, as well as for management practice.
Centrality and Network Flow
"... Centrality measures, or at least our interpretations of these measures, make implicit assumptions about the manner in which things flow through a network. For example, some measures count only geodesic paths, apparently assuming that whatever flows through the network only moves along the shortest p ..."
Abstract

Cited by 166 (4 self)
 Add to MetaCart
Centrality measures, or at least our interpretations of these measures, make implicit assumptions about the manner in which things flow through a network. For example, some measures count only geodesic paths, apparently assuming that whatever flows through the network only moves along the shortest possible paths. This paper lays out a typology of network flows based on two dimensions of variation, namely, the kinds of trajectories that traffic may follow (geodesics, paths, trails or walks), and the method of spread (broadcast, serial replication, or transfer). Measures of centrality are then matched to the kinds of flows they are appropriate for. Simulations are used to examine the relationship between type of flow and the differential importance of nodes with respect to key measurements such as speed of reception of traffic and frequency of receiving traffic. It is shown that the offtheshelf formulas for centrality measures are fully applicable only for the specific flow processes they are designed for, and that when they are applied to other flow processes they get the “wrong” answer. It is noted that the most commonly used centrality measures are not appropriate for most of the flows we are routinely interested in. A key claim made in this paper is that centrality measures can be regarded as generating expected values for certain kinds of node outcomes (such as speed and frequency of reception) given implicit models of how things flow.
The complexity of searching a graph
"... T. Parsons originally proposed and studied the following pursuitevasion problem on graphs: Members of a team of searchers traverse the edges of a graph G in pursuit of a fugitive, who moves along the edges of the graph with complete knowledge of the locations of the pursuers. What is the smallest ..."
Abstract

Cited by 159 (0 self)
 Add to MetaCart
T. Parsons originally proposed and studied the following pursuitevasion problem on graphs: Members of a team of searchers traverse the edges of a graph G in pursuit of a fugitive, who moves along the edges of the graph with complete knowledge of the locations of the pursuers. What is the smallest number s(G) of searchers that will suffice for guaranteeing capture of the fugitive? It is shown that determining whether s(G) 5 K, for a given integer K, is NPcomplete for general graphs but can be solved in linear time for trees. We also provide a structural characterization of those graphs G with s(G) I KforK = 1, 2, 3.
Controlling Formations of Multiple Mobile Robots
 in Proceedings of the IEEE International Conference on Robotics and Automation
, 1998
"... In this paper we investigate feedback laws used to control multiple robots moving together in a formation. We propose a method for controlling formations that uses only local sensorbased information, in a leaderfollower motion. We use methods of feedback linearization to exponentially stabilize th ..."
Abstract

Cited by 154 (23 self)
 Add to MetaCart
(Show Context)
In this paper we investigate feedback laws used to control multiple robots moving together in a formation. We propose a method for controlling formations that uses only local sensorbased information, in a leaderfollower motion. We use methods of feedback linearization to exponentially stabilize the relative distance and orientation of the follower, and show that the zero dynamics of the system are also (asymptotically) stable. We demonstrate in simulation the use of these algorithms to control six robots moving around an obstacle. These types of control laws can be used to control arbitrarily large numbers of robots moving in very general types of formations. Keywords: Nonholonomic motion planning, Control theory and Formations of robots. 1 Introduction This paper addresses issues of control and coordination for many robots moving in formation using decentralized controllers. The research on control and motion planning for mobile robots is both extensive and diverse. In the area o...
A formal model of program dependences and its implications for software testing, debugging, and maintenance
 IEEE Transactions on Software Engineering
, 1990
"... AbstractA formal, general model of program dependences is presented and used to evaluate several dependencebased software testing, debugging, and maintenance techniques. Two generalizations of control and data flow dependence, called weak and strong syntactic dependence, are introduced and rela ..."
Abstract

Cited by 151 (2 self)
 Add to MetaCart
(Show Context)
AbstractA formal, general model of program dependences is presented and used to evaluate several dependencebased software testing, debugging, and maintenance techniques. Two generalizations of control and data flow dependence, called weak and strong syntactic dependence, are introduced and related to a concept called semantic dependence. Semantic dependence models the ability of a program statement to affect the execution behavior of other statements. It is shown, among other things, that weak syntactic dependence is a necessary but not sufficient condition for semantic dependence and that strong syntactic dependence is a necessary but not sufficient condition for a restricted form of semantic dependence that is finitely demonstrated. These results are then used to support some proposed uses of program dependences, to controvert others, and to suggest new uses.
Liegroup methods
 ACTA NUMERICA
, 2000
"... Many differential equations of practical interest evolve on Lie groups or on manifolds acted upon by Lie groups. The retention of Liegroup structure under discretization is often vital in the recovery of qualitatively correct geometry and dynamics and in the minimization of numerical error. Having ..."
Abstract

Cited by 149 (24 self)
 Add to MetaCart
Many differential equations of practical interest evolve on Lie groups or on manifolds acted upon by Lie groups. The retention of Liegroup structure under discretization is often vital in the recovery of qualitatively correct geometry and dynamics and in the minimization of numerical error. Having introduced requisite elements of differential geometry, this paper surveys the novel theory of numerical integrators that respect Liegroup structure, highlighting theory, algorithmic issues and a number of applications.
Algorithms for the Satisfiability (SAT) Problem: A Survey
 DIMACS Series in Discrete Mathematics and Theoretical Computer Science
, 1996
"... . The satisfiability (SAT) problem is a core problem in mathematical logic and computing theory. In practice, SAT is fundamental in solving many problems in automated reasoning, computeraided design, computeraided manufacturing, machine vision, database, robotics, integrated circuit design, compute ..."
Abstract

Cited by 145 (3 self)
 Add to MetaCart
(Show Context)
. The satisfiability (SAT) problem is a core problem in mathematical logic and computing theory. In practice, SAT is fundamental in solving many problems in automated reasoning, computeraided design, computeraided manufacturing, machine vision, database, robotics, integrated circuit design, computer architecture design, and computer network design. Traditional methods treat SAT as a discrete, constrained decision problem. In recent years, many optimization methods, parallel algorithms, and practical techniques have been developed for solving SAT. In this survey, we present a general framework (an algorithm space) that integrates existing SAT algorithms into a unified perspective. We describe sequential and parallel SAT algorithms including variable splitting, resolution, local search, global optimization, mathematical programming, and practical SAT algorithms. We give performance evaluation of some existing SAT algorithms. Finally, we provide a set of practical applications of the sat...