ADVANCED SEARCH
Advanced Search
FEEDBACK
 Please provide us with feedback
Found 8,839 of 1,394,228
|
|
Results 1 - 20 of 8,839
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
1
|
|
2
|
|
Bipartite Subgraphs and Quasi-Randomness
|
|
June 2004
|
|
Graphs and Combinatorics
, Volume 20 Issue 2
|
|
Publisher: Springer-Verlag
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
 |
|
We say that a family of graphs * is p-quasi-random, 0<p<1, if it shares typical properties of the random graph G(n,p); for a definition, see below. We denote by * the class of all graphs H for which * and ...
|
|
3
|
|
Payoff-Monotonic Game Dynamics and the Maximum Clique Problem
|
|
May 2006
|
|
Neural Computation
, Volume 18 Issue 5
|
|
Publisher: MIT Press
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 2 |
|
|
Evolutionary game-theoretic models and, in particular, the so-called replicator equations have recently proven to be remarkably effective at approximately solving the maximum clique and related problems. The approach is centered around a classic result ...
|
|
4
|
|
Parity, eulerian subgraphs and the Tutte polynomial
|
|
May 2008
|
|
Journal of Combinatorial Theory Series B
, Volume 98 Issue 3
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
Identities obtained by elementary finite Fourier analysis are used to derive a variety of evaluations of the Tutte polynomial of a graph G at certain points (a,b) where (a-1)(b-1)@?{2,4}. These evaluations are expressed in terms of eulerian subgraphs ...
Keywords: Correlation, Eulerian subgraphs, Fourier transform, Parity, Tutte polynomial, Weight enumerator
|
|
5
|
|
On a conjecture of Brown concerning accessible sets
|
|
April 2005
|
|
Journal of Combinatorial Theory Series A
, Volume 110 Issue 1
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
In this note we use a sequence constructed by Furstenberg in 1981 to disprove the following conjecture posed by Brown: If a set of positive numbers L is such that for any finite coloring of N there are arbitrarily long monochromatic sequences ...
Keywords: Ramsey theory, arithmetic progressions
|
|
6
|
|
Note: A generalized enumeration of labeled trees and reverse Prüfer algorithm
|
|
October 2007
|
|
Journal of Combinatorial Theory Series A
, Volume 114 Issue 7
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
A leader of a tree T on [n] is a vertex which has no smaller descendants in T. Gessel and Seo showed that@?T@?T"nu^(^#^o^f^l^e^a^d^e^r^s^i^n^T^)c^(^d^e^g^r^e^e^o^f^1^i^n^T^)=uP"n"-"1(1,u,cu), which is a generalization of Cayley's formula, where T"n is ...
Keywords:
Prüfer code, Bijection, Leader, Tree
|
|
7
|
|
8
|
|
The design and evaluation of parallel algorithms (abstract)
|
|
March 1994
|
|
CSC '94: Proceedings of the 22nd annual ACM computer science conference on Scaling up : meeting the challenge of complexity in real-world computing applications: meeting the challenge of complexity in real-world computing applications
|
Publisher: ACM
 Request Permissions
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
9
|
|
Symmetric bipartite graphs of prime valency
|
|
October 1990
|
|
European Journal of Combinatorics
, Volume 11 Issue 6
|
|
Publisher: Academic Press Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
10
|
|
Telecommunications network design algorithms
|
|
August 1993
|
|
Telecommunications network design algorithms
|
|
Publisher: McGraw-Hill, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 27 |
|
|
|
|
|
11
|
|
Many distances in planar graphs
|
|
January 2006
|
|
SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
|
|
Publisher: ACM
Request Permissions
|
|
Full text available: |
 Pdf
(215.58 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 15, Downloads (12 Months): 63, Downloads (Overall): 279, Citation Count: 5 |
|
|
Let G be a planar graph with n vertices and non-negative edge-lengths. Given a set of k pairs of vertices, we are interested in computing the distance in G between those k pairs of vertices. We describe how this can ...
|
|
12
|
|
13
|
|
Fault tolerant K-center problems
|
|
July 2000
|
|
Theoretical Computer Science
, Volume 242 Issue 1-2
|
|
Publisher: Elsevier Science Publishers Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 3 |
|
|
|
Keywords: K-center, approximation alogorithms, facility location, fault-tolerance
|
|
14
|
|
Algorithmica: Volume 38 Issue 4
|
|
January 2004
|
|
Algorithmica
|
|
Publisher: Springer-Verlag New York, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
15
|
|
16
|
|
Vehicle routing problem with elementary shortest path based column generation
|
|
October 2006
|
|
Computers and Operations Research
, Volume 33 Issue 10
|
|
Publisher: Elsevier Science Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 2 |
|
|
The usual column generation model for a Vehicle Routing Problem involves an elementary shortest-path subproblem. The worst-case complexity of the known algorithms for this problem being too high, the elementary-path constraint is usually relaxed. Indeed, ...
Keywords: branch-and-price, elementary shortest path, vehicle routing
|
|
17
|
|
Agent-Based Approach to Dynamic Meeting Scheduling Problems
|
|
July 2004
|
|
AAMAS '04: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
, Volume 3
|
|
Publisher: IEEE Computer Society
|
|
Full text available: |
Pdf
(218.46 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 13, Downloads (12 Months): 57, Downloads (Overall): 394, Citation Count: 7 |
|
|
Multi-Agent systems are being more and more widely used to address many distributed combinatorial real-world problems. One such problem is meeting scheduling (MS) that is characterized essentially by two features defined from both its inherently distributed ...
|
|
18
|
|
Proving SAT does not have small circuits with an application to the two queries problem
|
|
May 2008
|
|
Journal of Computer and System Sciences
, Volume 74 Issue 3
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
We show that if SAT does not have small circuits, then there must exist a small number of satisfiable formulas such that every small circuit fails to compute satisfiability correctly on at least one of these formulas. We use this result to show that ...
Keywords: SAT, Small circuits, Two queries
|
|
19
|
|
Nonrepetitive colorings of graphs
|
|
October 2002
|
|
Random Structures & Algorithms
, Volume 21 Issue 3-4
|
|
Publisher: John Wiley & Sons, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 2 |
|
|
A sequence a = a1a2. . . . an is said to be nonrepetitive if no two adjacent blocks of a are exactly the same. For instance, the sequence 1232321 contains a repetition 2323, while 123132123213 is ...
Keywords: graph colorings, nonrepetitive sequences
|
|
20
|
|
The subchromatic number of a graph
|
|
September 1989
|
|
Discrete Mathematics
, Volume 74 Issue 1-2
|
|
Publisher: Elsevier Science Publishers B. V.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 3 |
|
|
|
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Refine by Keywords
Save results to a Binder