Filters








79 Hits in 5.0 sec

On-line algorithms for 2-coloring hypergraphs via chip games

Javed A. Aslam, Aditi Dhagat
1993 Theoretical Computer Science  
Acknowledgment We thank Joel Spencer for suggesting this problem to us.  ...  Chip games At each step, an on-line algorithm for 2-coloring a k-hypergraph Z' is given a node jE V and the hyperedges Ei which contain j. It must then choose a color for this node, say red or blue.  ...  But our bound is constructir%e in that an adversary prevents the on-line algorithm from 2-coloring large hypergraphs by actually giving an example of a hypergraph which proves to be "bad" for on-line 2  ... 
doi:10.1016/0304-3975(93)90025-o fatcat:wxiii3qiqjepblsvn6nqj5pngm

Author index volume 112 (1993)

1993 Theoretical Computer Science  
Dhagat, On-line algorithms for 2-coloring hypergraphs via chip games Boissonnat, J.-D. and M. Teillaud, On the randomized construction of the Delaunay tree Bourgin, R.D. and S.E.  ...  Lorano, On sparse hard sets for counting classes Rus, T..  ... 
doi:10.1016/0304-3975(93)90032-o fatcat:3ugut4e2p5ehdccdsjmsvbqpua

Page 647 of Mathematical Reviews Vol. , Issue 94b [page]

1994 Mathematical Reviews  
algorithms for 2-coloring hypergraphs via chip games.  ...  They show that no on-line algorithm exists by placing the problem in a “chip game” context and giving an adversary strategy.  ... 

Hypergraphs: an introduction and review [article]

Xavier Ouvrard
2020 arXiv   pre-print
Particularly, different definitions of hypergraphs are compared, some unpublished work on the visualisation of large hypergraphs done by the author. This review does not pretend to be exhaustive.  ...  Hypergraphs were introduced in 1973 by Berg\'e.  ...  Hypergraph coloring The subject of hypergraph coloring extends the one of graph coloring; but there is not a single way of doing so.  ... 
arXiv:2002.05014v2 fatcat:zgey2j4jlzervkfvivi4jpya7a

Algebra in Computational Complexity (Dagstuhl Seminar 14391)

Manindra Agrawal, Valentine Kabanets, Thomas Thierauf, Christopher Umans, Marc Herbstritt
2015 Dagstuhl Reports  
Representation theory has emerged as an important tool in three separate lines of work: the "Geometric Complexity Theory" approach to P vs.  ...  Indeed, many of the deepest and most powerful results in Computational Complexity rely on algebraic proof techniques.  ...  2, and shows further extensions to hypergraphs admitting a near-balanced rainbow coloring with more than two colors.)  ... 
doi:10.4230/dagrep.4.9.85 dblp:journals/dagstuhl-reports/AgrawalKTU14 fatcat:iailudx2rrhaxenbi3d7ou73ly

Combinatorics, Probability and Computing

Noga Alon, Béla Bollobás, Ingo Wegener
2006 Oberwolfach Reports  
and random triangulations, on the design and analysis of randomized algorithms, and on the relationship between complexity and randomness.  ...  The meeting was dedicated to recent developments in these areas, focusing on the investigation of random graphs and probabilistic methods, on the study of stochastic processes including questions on percolation  ...  Since Z d is a bipartite graph, chips on different classes of the bipartition do not interact in the random walk model. This is not true in the Propp model, where they do interact via the rotors.  ... 
doi:10.4171/owr/2006/48 fatcat:cnquryyfpba6bhuesmwsx2vq34

The sandpile group of a trinity and a canonical definition for the planar Bernardi action [article]

Tamás Kálmán, Seunghun Lee, Lilla Tóthmérész
2020 arXiv   pre-print
Our canonical definition implies the compatibility with planar duality via an extremely short argument.  ...  Any balanced plane digraph gives rise to a trinity, i.e., a triangulation of the sphere with a three-coloring of the 0-simplices.  ...  In [14] , a greedy algorithm (called the hypergraphical Bernardi process) is given for finding the unique representing V -cut Jaeger tree for a hypertree f on E.  ... 
arXiv:1905.01689v4 fatcat:skdo2eebujaytmu2vjslwpezpa

Reference list of indexed articles

1995 Theoretical Computer Science  
-coloring hypergraphs via chip games (Marhemat- ical Games) 112 (2) (1993) 355-369 169. AS. Fraenkel. E.R. Schemerman and D. l!llman.  ...  No polynomial bound for the period of the parallel chip firing game on graphs (h'olr) 136 (2) ( 1994) 527-532 606. M.  ... 
doi:10.1016/0304-3975(95)80003-4 fatcat:5nnk76aalje5potfoeg7hksbce

14th International Symposium on Mathematical Programming

1990 Mathematical programming  
It is shown that for the success of the variant dom must ful ll a regularity property and that the choice of the normal vectors must meet some demands.Both requirements are ful lled if dom is polyhedral  ...  each line, k lines through each point, and through 2 di erent points there is at most one line.  ...  We denote by G H such a realization of the hypergraph H, that for any v1; v 2 2 V the edge v1v2 2 R i there exists the edge e 2 E such that v1; v 2 2 e .  ... 
doi:10.1007/bf01580875 fatcat:3jtclwmntzgjxkqs5uecombdaa

Circuit Complexity [chapter]

2011 The Probabilistic Method  
For each chip let Á be the indicator random variable for remaining on the board at the end of the game. Set È Á , the number of chips remaining on the board at the end of the game.  ...  For our purposes each faculty member is represented by a chip. Thé Ü ½ Ü µ-Tenure Game begins with Ü chips at level for ½ and no chips on level zero.  ...  As two points cannot lie on two lines, È contains no -cycle.  ... 
doi:10.1002/9780470277331.ch12 fatcat:hm7d426ycvezxfnv27o4ertg4e

How Small-World Interactions Can Lead to Improved Quantum Annealer Designs

Helmut G. Katzgraber, M.A. Novotny
2018 Physical Review Applied  
spins) to the native quasi-planar quantum processing unit graph results in a topology where a disordered Ising system can undergo a finite-temperature spin-glass transition, even when an Ising spin glass on  ...  The algorithm to place n SW /2 couplers on the top or bottom layer of Chimera is as follows.  ...  The ability to operate on qubits rather than bits is what gives the enticing game-changing potential possibilities to quantum computers.  ... 
doi:10.1103/physrevapplied.10.054004 fatcat:v5a7ez6fhnggdm43m5qo2gr5xa

Simplicial and cellular trees [chapter]

Art M. Duval, Caroline J. Klivans, Jeremy L. Martin
2016 IMA Volumes in Mathematics and its Applications  
On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension.  ...  A subtlety of the higherdimensional case is that enumeration must account for the possibility of torsion homology in trees, which is always trivial for graphs.  ...  Acknowledgements We thank our colleagues Amy Wagler and Jennifer Wagner for valuable suggestions regarding exposition and clarity.  ... 
doi:10.1007/978-3-319-24298-9_28 fatcat:oh5q37h55jcmvady7lukhisolq

2021 Index IEEE Transactions on Image Processing Vol. 30

2021 IEEE Transactions on Image Processing  
The Author Index contains the primary entry for each item, listed under the first author's name.  ...  ., +, TIP 2021 3499-3512 A Sparse Representation Based Joint Demosaicing Method for Single-Chip Polarized Color Sensor.  ...  ., +, TIP 2021 7608-7619 Data acquisition A Sparse Representation Based Joint Demosaicing Method for Single-Chip Polarized Color Sensor.  ... 
doi:10.1109/tip.2022.3142569 fatcat:z26yhwuecbgrnb2czhwjlf73qu

Chapter 4 Constraint Programming [chapter]

Francesca Rossi, Peter van Beek, Toby Walsh
2008 Foundations of Artificial Intelligence  
Constraint programming is a powerful paradigm for solving combinatorial search problems that draws on a wide range of techniques from artificial intelligence, operations research, algorithms, graph theory  ...  Languages based on logic programming (see Section 4.7) are well suited for a tight integration between the language and constraints since they are based on similar notions: relations and (backtracking)  ...  If no solution is found within that cutoff, the algorithm is restarted and run for t 2 steps, and so on until a solution is found.  ... 
doi:10.1016/s1574-6526(07)03004-0 fatcat:vrrxlx2nhjaajj27uvoepcefqa

Simplicial and Cellular Trees [article]

Art M. Duval, Caroline J. Klivans, Jeremy L. Martin
2015 arXiv   pre-print
On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension.  ...  A subtlety of the higher-dimensional case is that enumeration must account for the possibility of torsion homology in trees, which is always trivial for graphs.  ...  Acknowledgements We thank our colleagues Amy Wagler and Jennifer Wagner for valuable suggestions regarding exposition and clarity.  ... 
arXiv:1506.06819v1 fatcat:hjorlrfwljemnawlytoz57ppp4
« Previous Showing results 1 — 15 out of 79 results