|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 15645 occurrences of 5194 keywords
|
|
|
Results
Found 76671 publication records. Showing 76671 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
26 | Amit Anil Nanavati, Rahul Singh, Dipanjan Chakraborty 0001, Koustuv Dasgupta, Sougata Mukherjea, Gautam Das 0005, Siva Gurumurthy, Anupam Joshi |
Analyzing the Structure and Evolution of Massive Telecom Graphs. |
IEEE Trans. Knowl. Data Eng. |
2008 |
DBLP DOI BibTeX RDF |
Data mining Database Applications, Telecom Call Graphs, Graph algorithms, Social Network Analysis, Database Management, Information Technology and Systems |
26 | Zhengbing Bian, Qian-Ping Gu |
Computing Branch Decomposition of Large Planar Graphs. |
WEA |
2008 |
DBLP DOI BibTeX RDF |
computational study, Graph algorithms, planar graphs, algorithm engineering, branch-decomposition |
26 | Marc Demange, Tínaz Ekim |
Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs. |
TAMC |
2008 |
DBLP DOI BibTeX RDF |
unmatched pairs, Minimum Maximal Matching, regular bipartite graphs, stable marriage |
26 | Naoki Katoh, Shin-ichi Tanigawa |
Fast enumeration algorithms for non-crossing geometric graphs. |
SCG |
2008 |
DBLP DOI BibTeX RDF |
non-crossing geometric graphs, triangulation, enumeration |
26 | Ravi Kumar 0001, Andrew Tomkins, Erik Vee |
Connectivity structure of bipartite graphs via the KNC-plot. |
WSDM |
2008 |
DBLP DOI BibTeX RDF |
connectivity, bipartite graphs, connected components |
26 | Imad Rahal, Dongmei Ren, Weihua Wu, Anne Denton, Christopher Besemann, William Perrizo |
Exploiting edge semantics in citation graphs using efficient, vertical ARM. |
Knowl. Inf. Syst. |
2006 |
DBLP DOI BibTeX RDF |
Data mining, Link analysis, Association rule mining, Citation analysis, Graph databases, Frequent itemset mining, P-trees, Citation graphs |
26 | Fedor V. Fomin, Dimitrios M. Thilikos |
Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
embedded graphs, subexponential algorithms, Dominating set, parameterized algorithms, branch-width |
26 | Jie Gao 0001, Li Zhang 0001 |
Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs. |
PODC |
2004 |
DBLP DOI BibTeX RDF |
growth restricted graphs, routing, wireless networks, load balancing |
26 | Ashish Goel, Sanatan Rai, Bhaskar Krishnamachari |
Sharp thresholds For monotone properties in random geometric graphs. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
sharp thresholds, wireless networks, geometric random graphs |
26 | Christos Gkantsidis, Milena Mihail, Amin Saberi |
Conductance and congestion in power law graphs. |
SIGMETRICS |
2003 |
DBLP DOI BibTeX RDF |
powerlaw graphs, routing, congestion, expansion, internet topology, conductance |
26 | Jens Bæk Jørgensen, Lars Michael Kristensen |
Computer Aided Verification of Lamport's Fast Mutual Exclusion Algorithm Using Colored Petri Nets and Occurrence Graphs with Symmetries. |
IEEE Trans. Parallel Distributed Syst. |
1999 |
DBLP DOI BibTeX RDF |
Modelling and analysis of distributed systems, formal verification, symmetries, mutual exclusion, colored Petri nets, high-level Petri nets, state spaces, occurrence graphs |
26 | Sook-Yeon Kim, Kyung-Yong Chwa |
Optimal embeddings of multiple graphs into a hypermesh. |
ICPADS |
1997 |
DBLP DOI BibTeX RDF |
optimal embeddings, multiple graphs, hypermesh, versatile parallel architecture, 2-dimensional mesh, linear connection, hyper-edge, labeling strategy, optimal expansion, N-node graph, hypercube, hypercube networks, congestion, torus, dilation |
26 | Olivier Cogis, Olivier Guinaldo |
A Linear Descriptor for Conceptual Graphs and a Class for Polynomial Isomorphism Test. |
ICCS |
1995 |
DBLP DOI BibTeX RDF |
structural functions, classes of conceptual graphs, descriptors, Isomorphism problem |
26 | Ignaz Rutter, Alexander Wolff 0001 |
Computing large matchings fast. |
SODA |
2008 |
DBLP BibTeX RDF |
|
26 | Johannes Köbler, Oleg Verbitsky 0001 |
From Invariants to Canonization in Parallel. |
CSR |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Reza Dorrigiv, Alejandro López-Ortiz, Pawel Pralat |
Search Algorithms for Unstructured Peer-to-Peer Networks. |
LCN |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Arnaud Pêcher, Annegret Wagler |
Almost all webs are not rank-perfect. |
Math. Program. |
2006 |
DBLP DOI BibTeX RDF |
Rank-perfect graph, Stable set polytope, (Non-)rank facet, Web |
26 | Arthur Brady, Lenore Cowen |
Compact routing with additive stretch using distance labelings. |
SPAA |
2006 |
DBLP DOI BibTeX RDF |
compact routing |
26 | Leizhen Cai, Siu Man Chan, Siu On Chan |
Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Peter Hui, Marcus Schaefer 0001, Daniel Stefankovic |
Train Tracks and Confluent Drawings. |
GD |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos |
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. |
WADS |
2001 |
DBLP DOI BibTeX RDF |
|
26 | King C. Ho, Sarma B. K. Vrudhula |
Interval graph algorithms for two-dimensional multiple folding of array-based VLSI layouts. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
1994 |
DBLP DOI BibTeX RDF |
|
26 | Hans L. Bodlaender, Klaus Jansen |
On the Complexity of the Maximum Cut Problem. |
STACS |
1994 |
DBLP DOI BibTeX RDF |
|
26 | Mariano P. Consens, Alberto O. Mendelzon |
The G+/GraphLog Visual Query System. |
SIGMOD Conference |
1990 |
DBLP DOI BibTeX RDF |
Smalltalk-80 |
26 | Marc J. Lipman, Robert L. Sedlmeyer |
Knowledge and reasoning in graph theory research (abstract only). |
ACM Conference on Computer Science |
1987 |
DBLP DOI BibTeX RDF |
|
26 | Antoni Marczyk |
On the Set of Cycle Lengths in a Hamiltonian Graph with a Given Maximum Degree. |
Graphs Comb. |
2004 |
DBLP DOI BibTeX RDF |
Pancyclic graphs, Cycles, Hamiltonian graphs |
25 | Philip Brisk, Majid Sarrafzadeh |
Interference graphs for procedures in static single information form are interval graphs. |
SCOPES |
2007 |
DBLP DOI BibTeX RDF |
k-colorable subgraph problem, linear scan register allocation, static single information (SSI) form, compilers, register allocation, interval graph |
25 | Martin Pergel |
Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete. |
WG |
2007 |
DBLP DOI BibTeX RDF |
|
25 | László Lovász 0001 |
Approximating Graphs by Graphs and Functions (Abstract). |
FCT |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Mitsunori Ogihara, Seinosuke Toda |
The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Alex R. Berg, Tibor Jordán |
Minimally k-Edge-Connected Directed Graphs of Maximal Size. |
Graphs Comb. |
2005 |
DBLP DOI BibTeX RDF |
Minimally k-edge-connected, Directed graphs, Edge-connectivity |
25 | Odile Favaron, Michael A. Henning |
Paired-Domination in Claw-Free Cubic Graphs. |
Graphs Comb. |
2004 |
DBLP DOI BibTeX RDF |
Claw-Free cubic graphs, Paired-domination, Bounds |
25 | Igor E. Zverovich |
A Characterization of Domination Reducible Graphs. |
Graphs Comb. |
2004 |
DBLP DOI BibTeX RDF |
Domination number, Hereditary class of graphs, Forbidden induced subgraph, Homogeneous set |
25 | Hilit Achiezra, Konstantin Golenberg, Benny Kimelfeld, Yehoshua Sagiv |
Exploratory keyword search on data graphs. |
SIGMOD Conference |
2010 |
DBLP DOI BibTeX RDF |
information retrieval on graphs, keyword search on graphs, redundancy elimination |
25 | Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk |
On grids in topological graphs. |
SCG |
2009 |
DBLP DOI BibTeX RDF |
tur?n-type problems, grids, geometric graphs, topological graphs |
25 | Shai Gutner |
Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
H-minor-free graphs, degenerated graphs, dominating set problem, fixed-parameter tractable algorithms, problem kernel |
25 | Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht |
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
quasi-random graphs, Laplacian eigenvalues, Grothendieck’s inequality, regularity lemma, sparse graphs |
25 | Cartic Ramakrishnan, William H. Milnor, Matthew Perry, Amit P. Sheth |
Discovering informative connection subgraphs in multi-relational graphs. |
SIGKDD Explor. |
2005 |
DBLP DOI BibTeX RDF |
multi-relational graphs, semantic pattern discovery in RDF graphs, subgraph discovery |
25 | Alexandr V. Kostochka, Vladimir A. Tashkinov |
Decomposing Graphs into Long Paths. |
Order |
2003 |
DBLP DOI BibTeX RDF |
edge-decompositions of graphs, 2-edge-connected graphs |
25 | Paolo Boldi, Sebastiano Vigna |
Lower bounds for sense of direction in regular graphs. |
Distributed Comput. |
2003 |
DBLP DOI BibTeX RDF |
sense of direction, Distributed computing, random graphs, regular graphs |
25 | Javier Campos, José Manuel Colom, Hauke Jungnitz, Manuel Silva Suárez |
Approximate Throughput Computation of Stochastic Marked Graphs. |
IEEE Trans. Software Eng. |
1994 |
DBLP DOI BibTeX RDF |
approximate throughput computation, stochastic marked graphs, stochastic strongly connected marked graphs, net decomposition, single input-single output cut, qualitative behavior, general decomposition technique, iterative response time approximation method, intractable systems, stochastic Petri net models, performance evaluation, Petri nets, error, stochastic processes, state space, iterative technique |
25 | Jacob Katzenelson, Shlomit S. Pinter, Eugen Schenfeld |
Type Matching, Type-Graphs, and the Schanuel Conjecture. |
ACM Trans. Program. Lang. Syst. |
1992 |
DBLP DOI BibTeX RDF |
Schanuel conjecture, graph hashing, mapping graphs to numbers, type matching, compilers, types, type-graphs |
25 | Alain Cournier, Michel Habib |
An Efficient Algorithm to Recognize Prime Undirected Graphs. |
WG |
1992 |
DBLP DOI BibTeX RDF |
substitution decomposition, autonomous subsets, modules, Undirected graphs, prime graphs |
25 | Mayez A. Al-Mouhamed |
Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs. |
IEEE Trans. Software Eng. |
1990 |
DBLP DOI BibTeX RDF |
precedence graphs, earliest starting time, task delay, finish time, minimum time increase, interprocessor communication links, optimum performance, small graphs, scheduling, scheduling, graph theory, lower bounds, communication costs, task graph, completion time, time interval |
25 | Manfred Kaul |
Specification of Error Distances for Graphs by Precedence Graph Grammars and Fast Recognition of Similarity. |
WG |
1986 |
DBLP DOI BibTeX RDF |
Additional Key Words and Phrases inexact graph matching, similarity of graphs, error distance between graphs, graph parser, parallel parsing, hierarchical graph model, graph grammar, precedence relations |
25 | Xinming Ou, Wayne F. Boyer, Miles A. McQueen |
A scalable approach to attack graph generation. |
CCS |
2006 |
DBLP DOI BibTeX RDF |
enterprise network security, ttack graphs, logic-programming |
24 | Thomas Andreae, Michael Nölle, Gerald Schreiber |
Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs (Extended Abstract). |
WG |
1994 |
DBLP DOI BibTeX RDF |
processor networks, parallel image processing and pattern recognition, dilation, graph embeddings, massively parallel computers, Cartesian product, de Bruijn graphs |
24 | Alessio Micheli |
Neural Network for Graphs: A Contextual Constructive Approach. |
IEEE Trans. Neural Networks |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Ken-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi |
Additive approximation algorithms for list-coloring minor-closed class of graphs. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Yuli Ye, Allan Borodin |
Elimination Graphs. |
ICALP (1) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Tínaz Ekim, Pinar Heggernes, Daniel Meister 0001 |
Polar Permutation Graphs. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura |
The stable set polytope of quasi-line graphs. |
Comb. |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C57, 90C10 |
24 | Muhammad Nur Yanhaona, K. S. M. Tozammel Hossain, Md. Saidur Rahman 0001 |
Pairwise Compatibility Graphs. |
WALCOM |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Noga Alon, Asaf Nussboim |
k-Wise Independent Random Graphs. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Huahai He, Ambuj K. Singh |
Graphs-at-a-time: query language and access methods for graph databases. |
SIGMOD Conference |
2008 |
DBLP DOI BibTeX RDF |
graph algebra, graph query language, query optimization |
24 | J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz 0001 |
Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Changxing Dong, Paul Molitor |
What Graphs can be Efficiently Represented by BDDs? |
ICCTA |
2007 |
DBLP DOI BibTeX RDF |
|
24 | David H. White 0001, Richard C. Wilson 0001 |
Spectral Generative Models for Graphs. |
ICIAP |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Robert Elsässer, Thomas Sauerwald |
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Amit Anil Nanavati, Siva Gurumurthy, Gautam Das 0005, Dipanjan Chakraborty 0001, Koustuv Dasgupta, Sougata Mukherjea, Anupam Joshi |
On the structural properties of massive telecom call graphs: findings and implications. |
CIKM |
2006 |
DBLP DOI BibTeX RDF |
graph analysis |
24 | Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber, Clemens Huemer, Ferran Hurtado, Hannes Krasser |
On the number of plane graphs. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
24 | David H. White 0001, Richard C. Wilson 0001 |
Mixing spectral representations of graphs. |
ICPR (4) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Yasuhiko Takenaga, Kenichi Higashide |
Vertex Coloring of Comparability+ke and -ke Graphs. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Raghav Kulkarni |
A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Erik Jan van Leeuwen |
Better Approximation Schemes for Disk Graphs. |
SWAT |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Timothy D. R. Hartley, Ümit V. Çatalyürek, Füsun Özgüner, Andy Yoo, Scott Kohn, Keith W. Henderson |
MSSG: A Framework for Massive-Scale Semantic Graphs. |
CLUSTER |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura |
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. |
IPCO |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini |
Dotted interval graphs and high throughput genotyping. |
SODA |
2005 |
DBLP BibTeX RDF |
|
24 | Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier |
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti |
List Partitions of Chordal Graphs. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu |
Efficient Parallel Algorithms for Planar st-Graphs. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Chandra Chekuri, Anupam Gupta 0001, Ilan Newman, Yuri Rabinovich, Alistair Sinclair |
Embedding k-outerplanar graphs into l1. |
SODA |
2003 |
DBLP BibTeX RDF |
|
24 | Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson |
Powers of Geometric Intersection Graphs and Dispersion Algorithms. |
SWAT |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. |
APPROX |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Rajeev Alur, Kousha Etessami, Mihalis Yannakakis |
Realizability and Verification of MSC Graphs. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Hua Lee |
Routing and Embeddings in Super Cayley Graphs. |
PaCT |
1999 |
DBLP DOI BibTeX RDF |
|
24 | Daishin Nakamura, Akihisa Tamura |
The Generalized Stable Set Problem for Claw-Free Bidirected Graphs. |
IPCO |
1998 |
DBLP DOI BibTeX RDF |
|
24 | Salvatore La Torre, Margherita Napoli |
Representing Hyper-Graphs by Regular Languages. |
MFCS |
1998 |
DBLP DOI BibTeX RDF |
|
24 | Rudolf Wille |
Triadic Concept Graphs. |
ICCS |
1998 |
DBLP DOI BibTeX RDF |
|
24 | Petr Hlinený, Jan Kratochvíl |
Computational Complexity of the Krausz Dimension of Graphs. |
WG |
1997 |
DBLP DOI BibTeX RDF |
|
24 | Catherine Faron, Jean-Gabriel Ganascia |
Representation of Defaults and Exceptions in Conceptual Graphs Formalism. |
ICCS |
1997 |
DBLP DOI BibTeX RDF |
|
24 | Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos |
Isomorphism for Graphs of Bounded Distance Width. |
CIAC |
1997 |
DBLP DOI BibTeX RDF |
|
24 | Mitsuharu Yamamoto, Shin-ya Nishizaki, Masami Hagiya, Yozo Toda |
Formalization of Planar Graphs. |
TPHOLs |
1995 |
DBLP DOI BibTeX RDF |
|
24 | Jitender S. Deogun, Dieter Kratsch |
Diametral Path Graphs. |
WG |
1995 |
DBLP DOI BibTeX RDF |
|
24 | Feodor F. Dragan, Andreas Brandstädt |
Dominating Cliques in Graphs with Hypertree Structures. |
STACS |
1994 |
DBLP DOI BibTeX RDF |
|
24 | Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis |
Optimal Parallel Algorithms for Sparse Graphs. |
WG |
1990 |
DBLP DOI BibTeX RDF |
|
24 | Bogdan S. Chlebus, Krzysztof Diks, Wojciech Rytter, Tomasz Szymacha |
Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract). |
MFCS |
1989 |
DBLP DOI BibTeX RDF |
|
24 | M. G. Karunambigai, Appu Muthusamy |
On Resolvable Multipartite G-Designs II. |
Graphs Comb. |
2006 |
DBLP DOI BibTeX RDF |
Cycle-factorization, Wreath product of graphs, Complete symmetric k?partite multi-digraph, Resolvable multipartite G -design |
24 | Adrian Riskin |
On the Nonembeddability and Crossing Numbers of Some Kleinical Polyhedral Maps on the Torus. |
Graphs Comb. |
2005 |
DBLP DOI BibTeX RDF |
Reimbedding, Nontoroidal graphs, Crossing numbers |
24 | Igor E. Zverovich |
A Solution to a Problem of Jacobson, Kézdy and Lehel. |
Graphs Comb. |
2004 |
DBLP DOI BibTeX RDF |
Line graphs of linear hypergraphs, Forbidden induced subgraphs |
24 | Miroslav Chlebík, Janka Chlebíková |
Approximation hardness of edge dominating set problems. |
J. Comb. Optim. |
2006 |
DBLP DOI BibTeX RDF |
Minimum edge dominating set, Minimum maximal matching, Approximation lower bound, Everywhere dense graphs, Bounded degree graphs |
24 | Sabeel Ansari, Lata Narayanan, Jaroslav Opatrny |
A Generalization of the Face Routing Algorithm to a Class of Non-Planar Networks. |
MobiQuitous |
2005 |
DBLP DOI BibTeX RDF |
crossing edges, ad hoc networks, Wireless networks, MANET, routing algorithms, planar graphs, geometric graphs, position-based routing |
24 | Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Weighted Coloring: Further Complexity and Approximability Results. |
ICTCS |
2005 |
DBLP DOI BibTeX RDF |
weighted coloring, line graph of bipartite graphs, Approximation algorithm, NP-complete problems, interval graphs, partial k-tree |
24 | Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter |
On Clique-Transversals and Clique-Independent Sets. |
Ann. Oper. Res. |
2002 |
DBLP DOI BibTeX RDF |
clique-independent sets, clique-perfect graphs, clique-transversals, highly clique-imperfect graphs, linear programming, integer linear programming |
24 | Enrique Teruel, Piotr Chrzastowski-Wachtel, José Manuel Colom, Manuel Silva Suárez |
On Weighted T-Systems. |
Application and Theory of Petri Nets |
1992 |
DBLP DOI BibTeX RDF |
weighted T-graphs, Structure theory, Marked Graphs |
23 | Louis Ibarra |
Fully dynamic algorithms for chordal graphs and split graphs. |
ACM Trans. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
clique trees, split graphs, chordal graphs, Dynamic graph algorithms |
23 | Michael A. Henning, Douglas F. Rall |
On the Total Domination Number of Cartesian Products of Graphs. |
Graphs Comb. |
2005 |
DBLP DOI BibTeX RDF |
Total domination, Vizings conjecture, Graph products |
23 | Haixing Zhao, Xueliang Li 0001, Ruying Liu, Chengfu Ye |
The Chromaticity of Certain Complete Multipartite Graphs. |
Graphs Comb. |
2004 |
DBLP DOI BibTeX RDF |
Chromatic uniqueness, Adjoint polynomial, Adjoint uniqueness |
23 | Elizabeth J. Billington, Dean G. Hoffman |
Trades and Graphs. |
Graphs Comb. |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed |
Recognizing Planar Strict Quasi-Parity Graphs. |
Graphs Comb. |
2001 |
DBLP DOI BibTeX RDF |
|
Displaying result #201 - #300 of 76671 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ >>] |
|