BarrosH's graph [92 articles] Export Sort

Recent papers added to BarrosH's library classified by the tag graph. You can also see everyone's graph.

Hide details

	Rigorous Result for the CHKNS Random Graph Model [My Copy] In Discrete Random Walks, DRW'03, Vol. AC (2003), pp. 95-104. by Rick Durrett edited by Cyril Banderier, Christian Krattenthaler posted to analysis brownian clusterization graph motion random singularity by BarrosH on 2006-05-07 16:05:59 as
	Well-spread sequences and edge-labellings with constant Hamilton-weight [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 6, No. 2. (2004), pp. 401-408. by Mark P. Kayll posted to cycle graph hamilton labelling sidon weak well-spread by BarrosH on 2006-05-07 16:05:52 as
	On Linear Layouts of Graphs [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 6, No. 2. (2004), pp. 339-358. by Vida Dujmovic, David R. Wood posted to arch book book-thickness drawing embedding graph layout page-number queue queue-number stack stack-number by BarrosH on 2006-05-07 16:05:51 as
	New Results on Generalized Graph Coloring [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 6, No. 2. (2004), pp. 215-222. by Vladimir E. Alekseev, Alastair Farrugia, Vadim V. Lozin posted to algorithm coloring generalized graph np-completeness polynomial by BarrosH on 2006-05-07 16:05:51 as
	The $b$-chromatic number of power graphs [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 6, No. 1. (2003), pp. 45-54. by Brice Effantin, Hamamache Kheddouci posted to and b-chromatic binary coloring complete cycle graph number path power tree by BarrosH on 2006-05-07 16:05:49 as
	Partially Complemented Representations of Digraphs [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 5, No. 1. (2002), pp. 147-168. by Elias Dahlhaus, Jens Gustedt, Ross M. Mcconnell posted to algorithms data decomposition efficient graph modular search strategies structures by BarrosH on 2006-05-07 16:05:48 as
	Graph Decompositions and Factorizing Permutations [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 5, No. 1. (2002), pp. 55-70. by Christian Capelle, Michel Habib, Fabien de Montgolfier posted to decomposition factorizing graph permutations by BarrosH on 2006-05-07 16:05:46 as
	An Efficient Algorithm for the Maximum Distance Problem [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 4, No. 2. (2001), pp. 323-350. by Gabrielle A. Grün posted to algorithms and data distance graph maximum of problem reasoning structures temporal theoryanalysis by BarrosH on 2006-05-07 16:05:45 as
	Minimum Eccentricity Multicast Trees [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 4, No. 2. (2001), pp. 157-172. by David Krumme, Paraskevi Fragopoulou posted to algorithm communications eccentricity graph multicast network by BarrosH on 2006-05-07 16:05:44 as
	Cubic Cayley graphs with small diameter. [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 4, No. 2. (2001), pp. 123-132. by Eugene Curtin posted to cayley cubic diameter graph group permutation polyas theorem by BarrosH on 2006-05-07 16:05:43 as
	$P_4$-Colorings and $P_4$-Bipartite Graphs [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 4, No. 2. (2001), pp. 109-122. by Ch\ính T. Hoàng, Van B. Le posted to cograph conjectrue graph np-completeness partition perfect strong the by BarrosH on 2006-05-07 16:05:43 as
	A note on domino treewidth [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 3, No. 4. (1999), pp. 141-150. by Hans L. Bodlaender posted to algorithms decompositions domino graph tree treewidth by BarrosH on 2006-05-07 16:05:39 as
	NP-Completeness Results for Minimum Planar Spanners [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 3, No. 1. (1998), pp. 1-10. by Ulrik Brandes, Dagmar Handke posted to graph graphs np-completeness planar spanners by BarrosH on 2006-05-07 16:05:36 as
	On $P_4$-tidy graphs [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 1, No. 1. (1997), pp. 17-41. by V. Giakoumakis, F. Roussel, H. Thuillier posted to decomposition graph modular p_4-structure perfection by BarrosH on 2006-05-07 16:05:22 as
	Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs [My Copy] SIAM Journal on Computing, Vol. 28, No. 3. (1999), pp. 1004-1020. by Wen-Lian Hsu, Tze-Heng Ma posted to algorithm graph by BarrosH on 2006-05-07 16:03:11 as
	Linear-time transitive orientation [My Copy] In SODA '97: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms (1997), pp. 19-25. by Ross M. Mcconnell, Jeremy P. Spinrad posted to algorithm graph by BarrosH on 2006-05-06 17:37:49 as
	An efficient algorithm for maxdominance, with applications [My Copy] Algorithmica, Vol. 4, No. 1. (December 1989), pp. 221-236. by Mikhail J. Atallah, Rao S. Kosaraju posted to algorithm graph by BarrosH on 2006-05-05 13:12:12 as
	Random walks on graphs: ideas, techniques and results [My Copy] (6 Jul 2005) by R. Burioni, D. Cassi posted to graph probability by BarrosH on 2006-04-29 05:16:41 as along with 8 people and 6 groups korakot ansobol jrw ChaTo euclid balicea gane5h mamader Philosophy_of_Information Blog_and_Wiki_Research Algorithms metric_embeddings TCS Polytopes
	NC algorithms for dominations in permutation graphs [My Copy] In SAC '92: Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing (1992), pp. 734-739. by Y. D. Liang, C. Rhee, S. K. Dhall, S. Lakshmivarahan posted to algorithm graph by BarrosH on 2006-04-27 16:15:37 as along with 1 person AlanMicfox
	Finding a minimum independent dominating set in a permutation graph [My Copy] Discrete Applied Mathematics, Vol. 21, No. 3. (October 1988), pp. 177-183. by Mikhail J. Atallah, Glenn K. Manacher, J. Urrutia posted to algorithm graph by BarrosH on 2006-04-27 16:14:50 as along with 1 person gjxu
	Domination in permutation graphs [My Copy] Journal of Algorithms, Vol. 6, No. 3. (September 1985), pp. 309-321. by Martin Farber, Mark posted to algorithm graph by BarrosH on 2006-04-27 16:14:43 as
	On domination problems for permutation and other graphs [My Copy] Theoretical Computer Science, Vol. 54, No. 2-3. (October 1987), pp. 181-198. by Andreas Brandstadt, Dieter Kratsch posted to algorithm graph by BarrosH on 2006-04-27 16:14:33 as
	An $O(N + M)$-Time Algorithm for Finding a Minimum-WeightDominating Set in a Permutation Graph [My Copy] SIAM J. Comput., Vol. 25, No. 2. (February 1996), pp. 404-419. by C. Rhee, Y. D. Liang, S. K. Dhall, S. Lakshmivarahan posted to algorithm graph by BarrosH on 2006-04-27 16:14:25 as
	Enumerative and algebraic aspects of matroids and hyperplane arrangements [My Copy] (2003) by Federico Ardila posted to algebra combinatorics graph by BarrosH on 2006-04-18 13:32:07 as
	Handle-rewriting hypergraph grammars [My Copy] Journal of Computer and System Sciences, Vol. 46, No. 2. (April 1993), pp. 218-270. by Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg posted to algorithm computation graph symbolic by BarrosH on 2006-04-09 23:30:45 as
	On the hardness of approximating minimization problems [My Copy] J. ACM, Vol. 41, No. 5. (September 1994), pp. 960-981. by Carsten Lund, Mihalis Yannakakis posted to algorithm approximation complexity computation graph by BarrosH on 2006-04-09 06:16:34 as along with 1 person and 1 group condon beta
	Minimum independent dominating sets of random cubic graphs [My Copy] Random Struct. Algorithms, Vol. 21, No. 2. (September 2002), pp. 147-161. by W. Duckworth, N. C. Wormald posted to algorithm approximation graph by BarrosH on 2006-04-08 17:56:59 as
	Approximating maximum independent set in bounded degree graphs [My Copy] In SODA '94: Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms (1994), pp. 365-371. by Piotr Berman, Martin F&\#252;rer posted to algorithm approximation graph by BarrosH on 2006-04-08 17:44:42 as
	Hardness of Approximating Independent Domination in Circle Graphs [My Copy] In ISAAC '99: Proceedings of the 10th International Symposium on Algorithms and Computation (1999), pp. 56-69. by Mirela Damian-Iordache, Sriram V. Pemmaraju posted to algorithm approximation graph by BarrosH on 2006-04-08 17:43:21 as
	Improved Approximations of Independent Dominating Set in Bounded Degree Graphs [My Copy] In WG '96: Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science (1997), pp. 2-16. by Paola Alimonti, Tiziana Calamoneri posted to algorithm approximation graph by BarrosH on 2006-04-08 17:36:08 as
	Graph Theory and Networks in Biology [My Copy] (6 Apr 2006) by Oliver Mason, Mark Verwoerd posted to biology graph math systems by BarrosH on 2006-04-08 08:08:23 as along with 13 people diamantis saket imouthesmp onyx lshaw karfunkel ptpases carlk Borelli ilkert ansobol mjoach dpf
	Zero knowledge and the chromatic number [My Copy] Computational Complexity, 1996. Proceedings., Eleventh Annual IEEE Conference on (1996), pp. 278-287. by U. Feige, J. Kilian posted to algorithm approximation complexity computation graph by BarrosH on 2006-04-04 14:16:03 as along with 1 person and 2 groups camu Crypto Randomness
	A New Parallel Algorithm for the Maximal Independent Set Problem [My Copy] SIAM Journal on Computing, Vol. 18, No. 2. (1989), pp. 419-427. by Mark Goldberg, Thomas Spencer posted to algorithm approximation graph parallel by BarrosH on 2006-04-03 05:15:47 as
	Approximating the minimum maximal independence number [My Copy] Information Processing Letters, Vol. 46, No. 4. (25 June 1993), pp. 169-172. by Magnus M. Halldorsson posted to algorithm approximation complexity computation graph by BarrosH on 2006-03-31 11:15:16 as
	On approximating the minimum independent dominating set [My Copy] Information Processing Letters, Vol. 37, No. 4. (28 February 1991), pp. 197-200. by Robert W. Irving posted to algorithm approximation graph by BarrosH on 2006-03-31 11:13:07 as
	A Simple Parallel Algorithm for the Maximal Independent Set Problem [My Copy] SIAM Journal on Computing, Vol. 15, No. 4. (1986), pp. 1036-1053. by Michael Luby posted to algorithm approximation economics graph parallel by BarrosH on 2006-03-29 19:02:36 as
	An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size [My Copy] SIAM Journal on Discrete Mathematics, Vol. 6, No. 3. (1993), pp. 443-459. by Mark Goldberg, Thomas Spencer posted to algorithm approximation graph parallel by BarrosH on 2006-03-29 18:57:31 as
	A fast and simple randomized parallel algorithm for the maximal independent set problem [My Copy] Journal of Algorithms, Vol. 7, No. 4. (December 1986), pp. 567-583. by Noga Alon, Laszlo Babai, Alon Itai posted to algorithm approximation graph parallel probability by BarrosH on 2006-03-29 18:48:17 as
	A Note on the Approximation of a Minimum-Weight Maximal Independent Set [My Copy] Computational Optimization and Applications, Vol. 14, No. 1. (July 1999), pp. 157-169. by Marc Demange posted to algorithm approximation cs graph by BarrosH on 2006-03-29 18:41:10 as
	A simple proof that finding a maximal independent set in a graph is in NC [My Copy] Information Processing Letters, Vol. 92, No. 4. (30 November 2004), pp. 185-187. by Aaron Windsor posted to algorithm complexity computation cs graph parallel by BarrosH on 2006-03-29 18:37:31 as
	On the parallel complexity of computing a maximal independent set in a hypergraph [My Copy] In STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing (1992), pp. 339-350. by Pierre Kelsen posted to algorithm cs graph parallel by BarrosH on 2006-03-29 18:27:36 as
	A simple parallel algorithm for the maximal independent set problem [My Copy] In STOC '85: Proceedings of the seventeenth annual ACM symposium on Theory of computing (1985), pp. 1-10. by M. Luby posted to algorithm graph parallel probability by BarrosH on 2006-03-29 18:13:37 as
	A fast parallel algorithm for the maximal independent set problem [My Copy] J. ACM, Vol. 32, No. 4. (October 1985), pp. 762-773. by Richard M. Karp, Avi Wigderson posted to algorithm graph parallel by BarrosH on 2006-03-29 18:13:27 as
	Complexity of Networks [My Copy] (17 Aug 2005) by Russell K. Standish posted to algorithm complexity graph information pre-print systems by BarrosH on 2006-03-27 20:36:24 as along with 2 people and 2 groups rahul cmm SRL FAB-lab
	The Energy of Graphs and Matrices [My Copy] (26 Mar 2006) by Vladimir Nikiforov posted to graph math physics pre-print by BarrosH on 2006-03-27 20:27:10 as along with 3 people ansobol estrabd gane5h
	Complex networks theory for analyzing metabolic networks [My Copy] (15 Mar 2006) by Jing Zhao, Hong Yu, Jianhua Luo, Cao, Yi-Xue Li posted to biology complexity graph pre-print systems by BarrosH on 2006-03-16 06:49:16 as along with 3 people and 1 group ansobol Borelli livingthingdan livingthing
	A probabilistic analysis of some tree algorithms [My Copy] (24 Feb 2006) by Hanène Mohamed, Philippe Robert posted to algorithm graph probability by BarrosH on 2006-02-27 23:07:47 as along with 2 people ansobol jrw
	Clique-decomposition, NLC-decomposition, and modular decomposition --- relationships and results for random graphs [My Copy] (1998) by O. Johansson posted to algorithm graph probability by BarrosH on 2006-02-27 06:29:17 as along with 1 person kamats
	Discrete Scale Invariance in Scale Free Graphs [My Copy] (14 Feb 2006) by Matías Graña, Juan P. Pinasco posted to complexity graph by BarrosH on 2006-02-15 20:17:26 as along with 1 person ansobol
	Scale-free networks from self-organization [My Copy] Physical Review E, Vol. 72, No. 2. (August 2005) by T. S. Evans, J. P. Saramäki posted to complexity graph physics systems by BarrosH on 2006-02-15 09:43:07 as

Note: You may cite this page as: http://www.citeulike.org/user/BarrosH/tag/graph

Result page: 1 2 Next

Sort by:
Order:	Default Ascending Descending
Empty fields:	Default First Last

algorithm	133
math	120
graph	92
complexity	86
combinatorics	77
computation	72
cs	68
systems	44
algebra	43
probability	39
biology	34
approximation	31
random	26
logic	25
physics	25
automata	22
information	17
programming	16
of	15
pre-print	15
functions	15
discrete	14
graphs	13
symbolic	13
generating	12
dynamical	12
geometry	12
algorithms	11
topology	11
tree	11
cellular	11
walk	10
parallel	10
analysis	10
trees	10
lattice	10
lie	9
group	9
function	8
permutations	7
model	7
search	7
study_method	7
decomposition	7
theory	6
binary	6
theorem	6
symmetric	6
tilings	5
set	5
permutation	5
walks	5
linear	5
word	4
convergence	4
problem	4
system	4
brownian	4
paths	4
data	4
markov	4
game	4
formula	4
operator	4
cycle	4
economics	4
numbers	4
modular	4
basis	4
height	4
sequence	4
polynomials	4
motion	4
algebras	4
polynomial	4
perfect	4
processes	4
np-completeness	4
words	4
partition	4
lyndon	3
generalized	3
central	3
surface	3
path	3
patterns	3
convex	3
groups	3
models	3
classification	3
phase	3
process	3
circuit	3
transition	3
method	3
matrices	3
finite	3
percolation	3
free	3
and	3
on	3
tableaux	3
closure	3
simple	3
tiling	3
structures	3
representation	3
sparse	3
cayley	3
history	3
series	3
proof	3
branching	2
distance	2
schur	2
boolean	2
pile	2
languages	2
limit	2
arrangements	2
sand	2
bijective	2
q-analogue	2
criteria	2
hyperplane	2
moments	2
subword	2
communications	2
planar	2
processing	2
critical	2
sieve	2
catalan	2
singularity	2
simplicial	2
overlap-free	2
conjecture	2
partitions	2
interval	2
grammars	2
q-analogs	2
recurrence	2
enumeration	2
circuits	2
constant	2
structure	2
statistical	2
matrix	2
ring	2
firing	2
decidability	2
networks	2
coloring	2
broken	2
saddle	2
algebraic	2
homogeneous	2
point	2
computational	2
network	2
weak	2
modulus	2
interacting	2
young	2
shuffle	2
pathwidth	2
chip	2
polyominoes	2
p_4-structure	2
number	2
fields	2
queue	2
methods	2
composite	2
transfer	2
average-case	2
mechanics	2
invariant	2
functional	2
poset	2
d0l	2
kernel	2
bounds	2
computations	2
dynamics	2
multicast	2
integer	2
rational	2
quasicrystals	2
distributive	2
lower	2
drawing	2
length	2
gas	2
matching	2
asymptotic	2
scheduling	2
bernoulli	2
forbidden	2
environment	2
recursive	2
uniform	2
factorization	2
complex	2
strong	2
asymptotics	2
rewriting	2
reconstruction	2
hilbert	2
decompositions	1
transforms	1
bi-infinite	1
second-order	1
sum	1
curves	1
monadic	1
embedding	1
non-crossing	1
resolution	1
heat	1
time	1
ratio	1
timing	1
harness	1
elias	1
transitive	1
treewidth	1
minimal	1
non-colliding	1
harmonic	1
moment	1
prediction	1
consistency	1
friendly	1
extremality	1
chebyshev	1
generic	1
rooted	1
robinson-schensted-knuth	1
scattering	1
catv	1
k-sat	1
descent	1
direct	1
one	1
routing	1
specification	1
re-indexation	1
lagrange	1
ramanujan	1
light	1
term	1
monomer-dimer	1
perfection	1
contexts	1
translations	1
burning	1
matroid	1
expanders	1
zeilbergers	1
the	1
sets	1
orientation	1
effect	1
normality	1
subgroups	1
estimates	1
self	1
polytechnic	1
recognition	1
sagbi-grobner	1
immune	1
page-number	1
urns	1
domino	1
design	1
hamming	1
queues	1
secret	1
maxima	1
p-fold	1
norm	1
strategies	1
blockcodes	1
signal	1
theories	1
partitioning	1
wz	1
subexceedant	1
q-binomial	1
cograph	1
karamatas	1
projection	1
degree	1
hypercubic	1
symmetry	1
van	1
dirichlet	1
schroder	1
block	1
permuvar	1
sources	1
summation	1
strip	1
balancing	1
bellman-harris	1
complete	1
distribution	1
magnus	1
multi-scale	1
ordered	1
well-spread	1
morphisms	1
t-design	1
granular	1
dyck	1
space-filling	1
tandem	1
symbols	1
identifying	1
lorentz	1
arrays	1
hexagon	1
special	1
substitution	1
reasoning	1
hypercube	1
b-chromatic	1
locating-dominating	1
mobile	1
polytope	1
implementation	1
p_4-indifference	1
spanning	1
definition	1
stanleys	1
thresholds	1
internal	1
coefficient	1
first-passage	1
bijections	1
bandwidth	1
finitely	1
sandpile	1
acceptance	1
sorting	1
ramified	1
persistence	1
claw-free	1
automatic	1
entropy	1
reliability	1
closed	1
stack-number	1
quasi-closed	1
trie	1
report	1
fibonacci	1
worst-case	1
fumctions	1
m-ary	1
clusterization	1
allocation	1
p-connected	1
chromatic	1
fault-tolerance	1
undecidability	1
case	1
datatypes	1
burkes	1
estimation	1
sour	1
hardy	1
non	1
size	1
scheme	1
3-colourability	1
large	1
recurrences	1
explicit	1
urn	1
identity	1
saturated	1
shape	1
markovian	1
lp	1
entropic	1
polyas	1
arrow	1
hard-core	1
piecewise	1
factorizing	1
locality	1
rules	1
unification	1
limiting	1
diameter	1
digits	1
maps	1
thermodynamics	1
queue-number	1
life	1
atomic	1
pseudo	1
diagonalization	1
deviations	1
media	1
predecessor	1
right-invariant	1
doubling	1
poissonization	1
clustering	1
genome	1
sums	1
compact	1
martingales	1
composition	1
blob	1
derangements	1
affine	1
university	1
implicational	1
presented	1
rhombus	1
parity	1
nested	1
matchings	1
streams	1
colorful	1
abelian	1
sidon	1
binomial	1
catalytic	1
bisection	1
histograms	1
california	1
existence	1
mellin	1
sufficient	1
nonlinear	1
gibbs	1
defect	1
constructions	1
first	1
analytic	1
shephard	1
first-order	1
noncommutative	1
labelling	1
denfants	1
formulae	1
randomization	1
string	1
hook-length	1
reciprocity	1
server	1
hd0l	1
transposition	1
inverse	1
latin	1
streaming	1
temporal	1
luis	1
rank-2	1
density	1
hurwitz	1
task	1
exponential	1
hironaka	1
anti-exchange	1
quicksort	1
numeration	1
q-equations	1
space-time	1
comparison	1
theoryanalysis	1
expanding	1
maximum	1
san	1
homology	1
discovery	1
codes	1
combinatorial	1
performance	1
cut	1
analytical	1
observational	1
toppling	1
reversibility	1
hamiltonian	1
eccentricity	1
self-organization	1
dual	1
cascades	1
stack	1
classes	1
carlitz	1
cubic	1

BarrosH's graph [92 articles] Export Sort

BarrosH's tags