• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 51,023
Next 10 →

Certifying algorithms for recognizing interval graphs and permutation graphs

by Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad - SIAM J. COMPUT , 2006
"... A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The certificate is a piece of evidence that proves that the answer has not been compromised by a bug in the implementation. We give linear-time certifying algorithms for recognition o ..."
Abstract - Cited by 44 (8 self) - Add to MetaCart
of interval graphs and permutation graphs, and for a few other related problems. Previous algorithms fail to provide supporting evidence when they claim that the input graph is not a member of the class. We show that our certificates of nonmembership can be authenticated in O(|V|) time.

Certifying Algorithms for Recognizing Interval Graphs andPermutation Graphs

by unknown authors
"... O(jVj) time. 1 Introduction A recognition algorithm is an algorithm that decideswhether some given input (graph, geometrical object, picture, etc.) has a certain property. Such an al-gorithm accepts the input if it has the property, and rejects it if it does not. A certifying algorithm for adecision ..."
Abstract - Add to MetaCart
for adecision problem is an algorithm that also provides a certificate with each acceptance or rejection. Thecertificate proves the correctness of the answer. We give linear-time certifying algorithms forrecognition of interval graphs and permutation graphs. Previous algorithms fail to provide support-ing

Community detection in graphs

by Santo Fortunato , 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

Reversible Markov chains and random walks on graphs

by David Aldous, James Allen Fill , 2002
"... ..."
Abstract - Cited by 549 (13 self) - Add to MetaCart
Abstract not found

A Graduated Assignment Algorithm for Graph Matching

by Steven Gold, Anand Rangarajan , 1996
"... A graduated assignment algorithm for graph matching is presented which is fast and accurate even in the presence of high noise. By combining graduated non-convexity, twoway (assignment) constraints, and sparsity, large improvements in accuracy and speed are achieved. Its low order computational comp ..."
Abstract - Cited by 378 (16 self) - Add to MetaCart
A graduated assignment algorithm for graph matching is presented which is fast and accurate even in the presence of high noise. By combining graduated non-convexity, twoway (assignment) constraints, and sparsity, large improvements in accuracy and speed are achieved. Its low order computational

An Efficient Boosting Algorithm for Combining Preferences

by Raj Dharmarajan Iyer , Jr. , 1999
"... The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new boosting ..."
Abstract - Cited by 707 (18 self) - Add to MetaCart
The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new

Statistical mechanics of complex networks

by Réka Albert, Albert-lászló Barabási - Rev. Mod. Phys
"... Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as ra ..."
Abstract - Cited by 2083 (10 self) - Add to MetaCart
as random graphs, it is increasingly recognized that the topology and evolution of real

Random Walks on Graphs: A Survey

by L. Lovász , 1993
"... ..."
Abstract - Cited by 406 (3 self) - Add to MetaCart
Abstract not found

Property Testing and its connection to Learning and Approximation

by Oded Goldreich, Shafi Goldwasser, Dana Ron
"... We study the question of determining whether an unknown function has a particular property or is ffl-far 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 k-colorable or having a ae-clique (clique of density ae

Invitation to Fixed-Parameter Algorithms

by Rolf Niedermeier , 2002
"... ..."
Abstract - Cited by 446 (80 self) - Add to MetaCart
Abstract not found
Next 10 →
Results 1 - 10 of 51,023
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2018 The Pennsylvania State University