|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1651 occurrences of 861 keywords
|
|
|
Results
Found 5849 publication records. Showing 5849 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
36 | Partha Dutta, Sharad Jaiswal, Debmalya Panigrahi, Rajeev Rastogi |
A New Channel Assignment Mechanism for Rural Wireless Mesh Networks. |
INFOCOM |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Shuji Isobe, Xiao Zhou 0001, Takao Nishizeki |
Total Colorings Of Degenerate Graphs. |
Comb. |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C15, 05C85, 90C39 |
36 | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch |
Exact Algorithms for Graph Homomorphisms. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky |
Online Conflict-Free Colorings for Hypergraphs. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Haytham Elghazel, Véronique Deslandres, Mohand-Said Hacid, Alain Dussauchoy, Hamamache Kheddouci |
A New Clustering Approach for Symbolic Data and Its Validation: Application to the Healthcare Data. |
ISMIS |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Khaled M. Elbassioni, Nabil H. Mustafa |
Conflict-Free Colorings of Rectangles Ranges. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger |
Threshold Functions for Asymmetric Ramsey Properties Involving Cliques. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Gruia Calinescu, Michael J. Pelsmajer |
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch |
Exact Algorithms for Graph Homomorphisms. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Takehiro Ito, Akira Kato, Xiao Zhou 0001, Takao Nishizeki |
Algorithms for Finding Distance-Edge-Colorings of Graphs. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Shuji Isobe, Xiao Zhou 0001, Takao Nishizeki |
Total Colorings of Degenerated Graphs. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Spyridoula M. Armeni, Dimitris Christodoulakis, Ioannis Kostopoulos, Polychronis D. Kountrias, Yannis C. Stamatiou, Michalis Nik Xenos |
An Information Hiding Method Based on Computational Intractable Problems. |
Panhellenic Conference on Informatics |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Xiao Zhou 0001, K. Fuse, Takao Nishizeki |
A Linear Algorithm for Finding [{g, f}]-Colorings of Partial {k}-Trees. |
Algorithmica |
2000 |
DBLP DOI BibTeX RDF |
|
36 | Antonio Lain, Prithviraj Banerjee |
Techniques to overlap computation and communication in irregular iterative applications. |
International Conference on Supercomputing |
1994 |
DBLP DOI BibTeX RDF |
|
34 | Hal A. Kierstead, Daqing Yang |
Orderings on Graphs and Game Coloring Number. |
Order |
2003 |
DBLP DOI BibTeX RDF |
k-coloring number, k-game coloring number, planar graphs |
34 | Yuval Rabani |
Path Coloring on the Mesh. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
minimum path coloring problem, circuit routing, mesh, vertices, packet routing, graph colouring, randomized rounding, all-optical networks, path coloring |
34 | C. R. Subramanian 0001 |
Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
minimum coloring random graphs, semi-random graphs, polynomial expected time, k-coloring, worst-case model, computational complexity, graph theory, vertices, graph colouring |
34 | Robert G. Herriot |
Algorithm 364: coloring polygonal regions [Z]. |
Commun. ACM |
1969 |
DBLP DOI BibTeX RDF |
coloring planar surfaces, coloring polygonal regions, drawing pictures, shading enclosed regions |
34 | Daniel Král, Pavel Nejedlý |
Group Coloring and List Group Coloring Are Pi2P-Complete (Extended Abstract). |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Johannes Schneider 0002, Roger Wattenhofer |
A new technique for distributed symmetry breaking. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
parallel algorithms, coloring, local algorithms, symmetry breaking, network decomposition |
33 | Haiying Wang |
On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Delta (G) = 3. |
J. Comb. Optim. |
2007 |
DBLP DOI BibTeX RDF |
The adjacent vertex-distinguishing total coloring, The adjacent vertex-distinguishing total chromatic number, Subdivision vertex, Subdivision graph |
33 | John Kalamatianos, Alireza Khalafi, David R. Kaeli, Waleed Meleis |
Analysis of Temporal-Based Program Behavior for Improved Instruction Cache Performance. |
IEEE Trans. Computers |
1999 |
DBLP DOI BibTeX RDF |
program reordering, graph pruning, graph coloring, Instruction caches, temporal locality, conflict misses |
33 | Abhik Roychoudhury, Susmita Sur-Kolay |
Efficient Algorithms for Vertex Arboricity of Planar Graphs. |
FSTTCS |
1995 |
DBLP DOI BibTeX RDF |
Vertex arboricity, testing of sequential circuits, graph coloring, planar graph |
31 | Jianfeng Hou, Guizhen Liu, Jianliang Wu |
Some Results on List Total Colorings of Planar Graphs. |
International Conference on Computational Science (3) |
2007 |
DBLP DOI BibTeX RDF |
total coloring, list total coloring, planar graph, cycle |
31 | Ken-ichi Kawarabayashi, Bojan Mohar |
Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
Hadwiger conjecture, odd-minor, graph coloring, graph minor, list coloring |
31 | Kelun Wang, Hongxiang Ren, Shuang Wang |
Study on Art Gallery Based on 4-coloring. |
CGIV |
2009 |
DBLP DOI BibTeX RDF |
|
31 | Zdenek Dvorák 0001, Ken-ichi Kawarabayashi, Robin Thomas 0001 |
Three-coloring triangle-free planar graphs in linear time. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
31 | Jirí Fiala 0001, Petr A. Golovach, Jan Kratochvíl |
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. |
TAMC |
2009 |
DBLP DOI BibTeX RDF |
|
31 | Wenjun Xiao, Wenhong Wei, Weidong Chen 0009, Mingxin He, Behrooz Parhami |
Comments on "Low Diameter Interconnections for Routing in High-Performance Parallel Systems, " with Connections and Extensions to Arc Coloring of Coset Graphs. |
IEEE Trans. Computers |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Mingen Lin, Zhiyong Lin, Jinhui Xu 0001 |
Almost optimal solutions for bin coloring problems. |
J. Comb. Optim. |
2008 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Online algorithms, Bin packing |
31 | Marco Chiarandini, Irina Dumitrescu, Thomas Stützle |
Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems. |
Hybrid Metaheuristics |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia |
Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs. |
TAMC |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre |
Approximating the Interval Constrained Coloring Problem. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Liu Wenyin, Anthony Y. Fu, Xiaotie Deng |
Exposing Homograph Obfuscation Intentions by Coloring Unicode Strings. |
APWeb |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Wangsen Feng, Li'ang Zhang, Wanling Qu, Hanpin Wang |
Approximation Algorithms for Maximum Edge Coloring Problem. |
TAMC |
2007 |
DBLP DOI BibTeX RDF |
|
31 | Takao Ono, Mutsunori Yagiura, Tomio Hirata |
A Vector Assignment Approach for the Graph Coloring Problem. |
LION |
2007 |
DBLP DOI BibTeX RDF |
|
31 | Vishal Doshi, Devavrat Shah, Muriel Médard, Sidharth Jaggi |
Distributed Functional Compression through Graph Coloring. |
DCC |
2007 |
DBLP DOI BibTeX RDF |
|
31 | Keith D. Cooper, Anshuman Dasgupta |
Tailoring Graph-coloring Register Allocation For Runtime Compilation. |
CGO |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Leah Epstein, Asaf Levin, Gerhard J. Woeginger |
Graph Coloring with Rejection. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Adrian Kosowski, Lukasz Kuszner |
On Greedy Graph Coloring in the Distributed Model. |
Euro-Par |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Hagit Attiya, Eshcar Hillel |
Built-In Coloring for Highly-Concurrent Doubly-Linked Lists. |
DISC |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Yasuhiko Takenaga, Kenichi Higashide |
Vertex Coloring of Comparability+ke and -ke Graphs. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Irit Dinur, Oded Regev 0001, Clifford D. Smyth |
The Hardness of 3-Uniform Hypergraph Coloring. |
Comb. |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68Q17 |
31 | Mingen Lin, Zhiyong Lin, Jinhui Xu 0001 |
Almost Optimal Solutions for Bin Coloring Problems. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Doruk Bozdag, Ümit V. Çatalyürek, Assefaw Hadish Gebremedhin, Fredrik Manne, Erik G. Boman, Füsun Özgüner |
A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers. |
HPCC |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Shenshen Gu |
An Improved Transiently Chaotic Neural Network for Solving the K-Coloring Problem. |
ISNN (1) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Thomas Bietenhader, Yoshio Okamoto |
Core Stability of Minimum Coloring Games. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Ünal Ufuktepe, Goksen Bacak, Tina Beseri |
Graph Coloring with web Mathematica. |
International Conference on Computational Science |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Noga Alon, Vera Asodi |
Edge Coloring with Delays. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Srinivasan Parthasarathy 0002, Rajiv Gandhi |
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Vangelis Th. Paschos |
Polynomial Approximation and Graph-Coloring. |
Computing |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification: 05C15, 68Q17, 68Q25, 90C59, 68W25 |
31 | Mansoor Alicherry, Randeep Bhatia |
Line System Design and a Generalized Coloring Problem. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Johan Runeson, Sven-Olof Nyström |
Retargetable Graph-Coloring Register Allocation for Irregular Architectures. |
SCOPES |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Cécile Murat, Vangelis Th. Paschos |
The Probabilistic Minimum Coloring Problem. |
WG |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Ioan Todinca |
Coloring Powers of Graphs of Bounded Clique-Width. |
WG |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Udo Adamy, Thomas Erlebach |
Online Coloring of Intervals with Bandwidth. |
WAOA |
2003 |
DBLP DOI BibTeX RDF |
|
31 | József Beck, Sachin Lodha |
Efficient proper 2-coloring of almost disjoint hypergraphs. |
SODA |
2002 |
DBLP BibTeX RDF |
|
31 | Nitin Ahuja, Anand Srivastav |
On Constrained Hypergraph Coloring and Scheduling. |
APPROX |
2002 |
DBLP DOI BibTeX RDF |
|
31 | Harold N. Gabow, San Skulrattanakulchai |
Coloring Algorithms on Subcubic Graphs. |
COCOON |
2002 |
DBLP DOI BibTeX RDF |
|
31 | Martin Charles Golumbic, Assaf Siani |
Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints. |
AISC |
2002 |
DBLP DOI BibTeX RDF |
|
31 | Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano |
Approximate Constrained Bipartite Edge Coloring. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
31 | Xiao Zhou 0001, Takao Nishizeki |
Algorithm for the Cost Edge-Coloring of Trees. |
COCOON |
2001 |
DBLP DOI BibTeX RDF |
|
31 | Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen |
lambda-Coloring of Graphs. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
31 | Olivier Coudert |
Exact Coloring of Real-Life Graphs is Easy. |
DAC |
1997 |
DBLP DOI BibTeX RDF |
|
31 | Hui Chen, Alan M. Frieze |
Coloring Bipartite Hypergraphs. |
IPCO |
1996 |
DBLP DOI BibTeX RDF |
|
31 | C. R. Subramanian 0001 |
Improved Algorithms for Coloring Random Graphs. |
ISAAC |
1994 |
DBLP DOI BibTeX RDF |
|
31 | C. R. Subramanian 0001, C. E. Veni Madhavan |
Coloring Semi-Random Graphs in Polynomial Expected Time. |
FSTTCS |
1994 |
DBLP DOI BibTeX RDF |
|
31 | Magnús M. Halldórsson |
Parallel and On-line Graph Coloring Algorithms. |
ISAAC |
1992 |
DBLP DOI BibTeX RDF |
|
31 | Fred C. Chow, John L. Hennessy |
Register allocation by priority-based coloring. |
SIGPLAN Symposium on Compiler Construction |
1984 |
DBLP DOI BibTeX RDF |
|
31 | Fred C. Chow, John L. Hennessy |
Register allocation by priority-based coloring (with retrospective) |
Best of PLDI |
1984 |
DBLP DOI BibTeX RDF |
|
31 | M. R. Garey, David S. Johnson |
The Complexity of Near-Optimal Graph Coloring. |
J. ACM |
1976 |
DBLP DOI BibTeX RDF |
|
29 | Flavia Bonomo, Mariano Cecowski Palacio |
Between coloring and list-coloring: μ-coloring. |
Ars Comb. |
2011 |
DBLP BibTeX RDF |
|
29 | Flavia Bonomo, Mariano Cecowski Palacio |
Between coloring and list-coloring: mu-coloring. |
Electron. Notes Discret. Math. |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc |
Distributed computing with advice: information sensitivity of graph coloring. |
Distributed Comput. |
2009 |
DBLP DOI BibTeX RDF |
Distributed computing, Graph coloring, Network algorithm |
29 | Leah Epstein, Thomas Erlebach, Asaf Levin |
Variable Sized Online Interval Coloring with Bandwidth. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Interval coloring, Approximation algorithm, Lower bound, Competitive analysis |
29 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky |
Coloring Geometric Range Spaces. |
Discret. Comput. Geom. |
2009 |
DBLP DOI BibTeX RDF |
Geometric hypergraphs, Decompositions, Coloring, Covering |
29 | Tobias Bandh, Georg Carle, Henning Sanneck |
Graph coloring based physical-cell-ID assignment for LTE networks. |
IWCMC |
2009 |
DBLP DOI BibTeX RDF |
physical cell ID, management, graph coloring, LTE |
29 | Haytham Elghazel, Khalid Benabdeslem |
Towards B-Coloring of SOM. |
MLDM |
2009 |
DBLP DOI BibTeX RDF |
graph b-coloring, topological organization, clustering, Self-organizing map |
29 | N. S. Narayanaswamy, R. Subhash Babu |
A Note on First-Fit Coloring of Interval Graphs. |
Order |
2008 |
DBLP DOI BibTeX RDF |
First fit for online graph coloring, Column construction method, Competitive analysis |
29 | Noureddine Bouhmala, Ole-Christoffer Granmo |
Solving Graph Coloring Problems Using Learning Automata. |
EvoCOP |
2008 |
DBLP DOI BibTeX RDF |
Combinatorial optimization, SAT, Learning automata, Graph coloring problem |
29 | Bernard Gendron, Alain Hertz, Patrick St-Louis |
On edge orienting methods for graph coloring. |
J. Comb. Optim. |
2007 |
DBLP DOI BibTeX RDF |
Edge orienting, Local search, Graph coloring |
29 | Pawel Terlecki, Krzysztof Walczak 0002 |
Jumping Emerging Pattern Induction by Means of Graph Coloring and Local Reducts in Transaction Databases. |
RSFDGrC |
2007 |
DBLP DOI BibTeX RDF |
jumping emerging pattern, pattern with negation, condensed decision table, rough set, graph coloring, transaction database, local reduct |
29 | Szymon Lukasik, Zbigniew Kokosinski, Grzegorz Swieton |
Parallel Simulated Annealing Algorithm for Graph Coloring Problem. |
PPAM |
2007 |
DBLP DOI BibTeX RDF |
graph coloring, parallel simulated annealing, parallel metaheuristic |
29 | Thomas P. Hayes, Juan Carlos Vera 0001, Eric Vigoda |
Randomly coloring planar graphs with fewer colors than the maximum degree. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
Markov chain Monte Carlo (MCMC), graph coloring, planar graphs, coupling |
29 | Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray |
Conflict-free coloring for rectangle ranges using O(n.382) colors. |
SPAA |
2007 |
DBLP DOI BibTeX RDF |
axis-parallel rectangles, conflict-free coloring, frequency assignment in wireless networks, monotone sequences, dominating sets |
29 | Djamel Gaceb, Véronique Eglin, Frank Lebourgeois, Hubert Emptoz |
A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring. |
ICIAR |
2007 |
DBLP DOI BibTeX RDF |
Text localization, physical segmentation, business documents processing, Graph coloring, real time processing |
29 | Adam H. Berliner, Ulrike Bostelmann, Richard A. Brualdi, Louis Deaett |
Sum List Coloring Graphs. |
Graphs Comb. |
2006 |
DBLP DOI BibTeX RDF |
Choosable function, Sum choice number, Sum choice greedy graph, Graph, List coloring |
29 | Irit Dinur, Elchanan Mossel, Oded Regev 0001 |
Conditional hardness for approximate coloring. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
graph coloring, hardness of approximation, unique games conjecture |
29 | Zhi-Zhong Chen, Mitsuharu Kouno |
A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs. |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
Plane embeddings, Plane embeddings, NP-completeness, Graph algorithms, Planar graphs, Planar graphs, Vertex coloring |
29 | Jon Lee 0001, Janny Leung, Sven de Vries |
Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation. |
J. Comb. Optim. |
2005 |
DBLP DOI BibTeX RDF |
odd cycle, integer program, separation, edge coloring, binary encoding |
29 | Klaus Jansen, Lorant Porkolab |
Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring. |
J. Sched. |
2004 |
DBLP DOI BibTeX RDF |
fractional graph coloring, scheduling, dedicated processors |
29 | Valmir Carneiro Barbosa, Carlos A. G. Assis, Josina O. do Nascimento |
Two Novel Evolutionary Formulations of the Graph Coloring Problem. |
J. Comb. Optim. |
2004 |
DBLP DOI BibTeX RDF |
genetic algorithms, evolutionary algorithms, genetic programming, graph coloring |
29 | Andrea Di Blas, Arun Jagota, Richard Hughey |
A Range-Compaction Heuristic for Graph Coloring. |
J. Heuristics |
2003 |
DBLP DOI BibTeX RDF |
iterative-greedy algorithm, DIMACS benchmarks, graph coloring |
29 | Thomas P. Hayes |
Randomly coloring graphs of girth at least five. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
Glauber dynamics, concentration inequalities, posterior analysis, graph coloring, Markov chain Monte Carlo, Chernoff bounds |
29 | José Luis González Velarde, Manuel Laguna |
Tabu Search with Simple Ejection Chains for Coloring Graphs. |
Ann. Oper. Res. |
2002 |
DBLP DOI BibTeX RDF |
ejection chains, tabu search, graph coloring, metaheuristics |
29 | David Eppstein, Marshall W. Bern, Brad L. Hutchings |
Algorithms for Coloring Quadtrees. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
Four-color theorem, Graph coloring, Quadtree |
29 | Jeonghun Cho, Yunheung Paek, David B. Whalley |
Efficient register and memory assignment for non-orthogonal architectures via graph coloring and MST algorithms. |
LCTES-SCOPES |
2002 |
DBLP DOI BibTeX RDF |
dual memory, memory assignment, non-orthogonal architecture, compiler, graph coloring, maximum spanning tree |
29 | Vangelis Th. Paschos |
On-line independent set by coloring vertices. |
Oper. Res. |
2001 |
DBLP DOI BibTeX RDF |
On-line computation, Approximation algorithm, Coloring, Independent set |
29 | Sara Nicoloso, Majid Sarrafzadeh, X. Song |
On the Sum Coloring Problem on Interval Graphs. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
Over-the-cell routing, Approximation algorithms, Coloring, VLSI-design, Interval graphs |
29 | Daniela Genius |
Handling Cross Interferences by Cyclic Cache Line Coloring. |
IEEE PACT |
1998 |
DBLP DOI BibTeX RDF |
cyclic graph coloring, meeting graph, cache optimization, memory mapping |
Displaying result #201 - #300 of 5849 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ >>] |
|