192 search results - page 34 / 39 » On Graph Isomorphism for Restricted Graph Classes |
97
Voted
FSTTCS
2000
Springer
15 years 3 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
CSL
2010
Springer
15 years 21 days ago
2010
Springer
We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistingu...
80
Voted
ANOR
2008
14 years 11 months ago
2008
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
STOC
2004
ACM
15 years 12 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...