Search results for "G-graphs"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
79	Stefan Felsner, Rudolf Müller, Lorenz Wernisch	Trapezoid Graphs and Generalizations, Geometry and Algorithms.	SWAT	1994	DBLP DOI BibTeX RDF	trapezoid graphs, circle graphs, Algorithms, partially ordered sets, circular-arc graphs, order dimension
77	Philippe Gambette, Stéphane Vialette	On Restrictions of Balanced 2-Interval Graphs.	WG	2007	DBLP DOI BibTeX RDF	2-interval graphs, graph classes, quasi-line graphs, circular interval graphs, scheduling, bioinformatics, line graphs, claw-free graphs
72	Guillaume Fertin, André Raspaud	Families of Graphs Having Broadcasting and Gossiping Properties.	WG	1998	DBLP DOI BibTeX RDF	minimum broadcast graphs, minimum gossip graphs, Knödel graphs, Broadcasting, hypercubes, gossiping, circulant graphs
72	Peter F. Corbett	Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks.	IEEE Trans. Parallel Distributed Syst.	1992	DBLP DOI BibTeX RDF	point-to-point multiprocessor networks, directed permutation graphs, Faber-Moore graphs, rotator graphs, one-step fault diagnosable, fault tolerant, topology, multiprocessor interconnection networks, directed graphs, Hamiltonian circuit, optimal routing algorithm
70	MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx	Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth.	STOC	2010	DBLP DOI BibTeX RDF	Steiner forest, bounded-genus graphs, bounded-treewidth graphs, planar graphs, PTAS, series-parallel graphs
63	Daniel Kobler, Udi Rotics	Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size.	Algorithmica	2003	DBLP DOI BibTeX RDF	Induced matching, Bull, Polynomial algorithms, Regular graphs, Line-graphs, Claw-free graphs
60	Andreas Jakoby, Till Tantau	Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs.	FSTTCS	2007	DBLP DOI BibTeX RDF	logspace algorithms, distance problem, longest path problem, bounded tree-width, K 4-minor-free graphs, Series-parallel graphs
59	Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn	Path-Bicolorable Graphs.	Graph Theory, Computational Intelligence and Thought	2009	DBLP DOI BibTeX RDF	P 3-bicolorable graphs, P 4-bicolorable graphs, linear time recognition, bipartite graphs
56	Frithjof Dau	Query Graphs with Cuts: Mathematical Foundations.	Diagrams	2004	DBLP DOI BibTeX RDF
55	Stavros D. Nikolopoulos, Leonidas Palios	Recognizing HHDS-Free Graphs.	WG	2005	DBLP DOI BibTeX RDF	HHD-free graphs, HHDS-free graphs, homogeneously orderable graphs, recognition, sun, perfectly orderable graphs
53	Günter Westphal, Christoph von der Malsburg, Rolf P. Würtz	Feature-Driven Emergence of Model Graphs for Object Recognition and Categorization.	Applied Pattern Recognition	2008	DBLP DOI BibTeX RDF	model graphs, parquet graphs, position-invariant feature detectors, infomax principle, preselection network, model candidates, emergence of model graphs, feature- vs. correspondence-based object recognition, compositionality, elastic graph matching
52	Tom Høholdt, Heeralal Janwa	Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes.	AAECC	2009	DBLP DOI BibTeX RDF	eigenvalues of graphs, finite geometries, LDPC and expander codes, Bipartite graphs, expander graphs, Ramanujan graphs, BIBD
52	Andreas Brandstädt, Van Bang Le	Simplicial Powers of Graphs.	COCOA	2008	DBLP DOI BibTeX RDF	simplicial powers, forbidden induced subgraph characterization, block graphs, ptolemaic graphs, strongly chordal graphs, chordal graphs, leaf powers, Graph powers
51	Frithjof Dau	An Embedding of Existential Graphs into Concept Graphs with Negations.	ICCS	2002	DBLP DOI BibTeX RDF
51	Andreas Brandstädt, Christian Hundt 0001	Ptolemaic Graphs and Interval Graphs Are Leaf Powers.	LATIN	2008	DBLP DOI BibTeX RDF	and Classification Leaf powers, leaf roots, strongly chordal graphs, ptolemaic graphs, graph class inclusions, (unit) interval graphs, clique-width, graph powers
51	Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman 0001	Approximating interval coloring and max-coloring in chordal graphs.	ACM J. Exp. Algorithmics	2005	DBLP DOI BibTeX RDF	Graph coloring, chordal graphs, dynamic storage allocation, perfect graphs
51	Krishnam Raju Jampani, Anna Lubiw	The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs.	WADS	2009	DBLP DOI BibTeX RDF	Simultaneous graphs, Sandwich graphs, Comparability graphs, Chordal graphs, Permutation graphs
48	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs.	J. ACM	2005	DBLP DOI BibTeX RDF	(k, r)-center, planar graph, domination, fixed-parameter algorithms, map graph
48	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs.	SODA	2004	DBLP BibTeX RDF
47	Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi	On the L(h, k)-Labeling of Co-comparability Graphs.	ESCAPE	2007	DBLP DOI BibTeX RDF	L(h and k)-Labeling, co-comparability graphs, unit-interval graphs, interval graphs
46	Satoru Watanabe, Satoshi Okawa	An Extended Star Graph: A Proposal of a New Network Topology and Its Fundamental Properties.	ISPA	2003	DBLP DOI BibTeX RDF	degree four Cayley graphs, hy- percubes, routing algorithm, diameter, Cayley graphs, star graphs
45	Alain Bretto, Luc Gillibert, Bernard Laget	Symmetric and semisymmetric graphs construction using G-graphs.	ISSAC	2005	DBLP DOI BibTeX RDF	G-graphs, graphs from group, semisymmetric graph, symmetric graphs
44	L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan	On the Cubicity of AT-Free Graphs and Circular-Arc Graphs.	Graph Theory, Computational Intelligence and Thought	2009	DBLP DOI BibTeX RDF	Cubicity, AT-free graphs, cocomparability graphs, bandwidth, circular-arc graphs, intersection graphs
44	Richard B. Borie, R. Gary Parker, Craig A. Tovey	Solving problems on recursively constructed graphs.	ACM Comput. Surv.	2008	DBLP DOI BibTeX RDF	Halin graph, branchwidth, cliquewidth, cutwidth, rankwidth, series parallel, dynamic programming, tree, Bandwidth, treewidth, cograph, pathwidth
44	Paola Alimonti, Tiziana Calamoneri	Improved Approximations of Independent Dominating Set in Bounded Degree Graphs.	WG	1996	DBLP DOI BibTeX RDF	Minimum Independent Dominating Set, Approximation Algorithms, Local Search, Greedy, Regular Graphs, Cubic Graphs, Bounded Degree Graphs
44	Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty 0001, Samir Datta, Sambuddha Roy	Planar and Grid Graph Reachability Problems.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Logspace, Algorithms, Planar graphs, Reachability, Complexity theory, Circuit complexity, Grid graphs
43	Andreas Brandstädt	On Robust Algorithms for the Maximum Weight Stable Set Problem.	FCT	2001	DBLP DOI BibTeX RDF	Maximum Weight Stable Set Problem on graphs, modules and homogeneous sets in graphs, graph structure, clique width, robust algorithms, prime graphs
43	Iztok Peterin	Characterizing Flag Graphs and Induced Subgraphs of Cartesian Product Graphs.	Order	2004	DBLP DOI BibTeX RDF	flag graphs, induced subgraphs, edge-labellings, Cartesian product graphs, quotient graphs
43	Mary Mehrnoosh Eshaghian, Ying-Chieh Wu	Mapping heterogeneous task graphs onto heterogeneous system graphs.	Heterogeneous Computing Workshop	1997	DBLP DOI BibTeX RDF	heterogeneous task graphs mapping, heterogeneous system graphs, heterogeneous task graphs, multilayer clustered graph, Spec graph, Rep graph, suboptimal matching, computational complexity
41	Martin Fürer, Shiva Prasad Kasiviswanathan	Approximately Counting Embeddings into Random Graphs.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
41	Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart	On Subfamilies of AT-Free Graphs.	WG	2001	DBLP DOI BibTeX RDF
41	Andreas Brandstädt, Van Bang Le	Split-Perfect Graphs: Characterizations and Algorithmic Use.	WG	2000	DBLP DOI BibTeX RDF
41	Balasubramanian Sivan, S. Harini, C. Pandu Rangan	Core and Conditional Core Path of Specified Length in Special Classes of Graphs.	WALCOM	2009	DBLP DOI BibTeX RDF	Core path, Conditional core path, Bipartite permutation graphs, Threshold graphs, Proper Interval graphs
41	Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos	Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs.	WG	2008	DBLP DOI BibTeX RDF
40	Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille	Recognizing Bipartite Incident-Graphs of Circulant Digraphs.	WG	1999	DBLP DOI BibTeX RDF	broadcasting, gossiping, graph isomorphism, circulant graphs, chordal rings
39	Noga Alon, Shai Gutner	Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.	Algorithmica	2009	DBLP DOI BibTeX RDF	H-minor-free graphs, Degenerated graphs, Dominating set problem, Finding an induced cycle, Fixed-parameter tractable algorithms
39	Noga Alon, Shai Gutner	Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.	COCOON	2007	DBLP DOI BibTeX RDF	H-minor-free graphs, degenerated graphs, dominating set problem, finding an induced cycle, fixed-parameter tractable algorithms
39	Rodrigo S. C. Leão, Valmir Carneiro Barbosa	Minimal Chordal Sense of Direction and Circulant Graphs.	MFCS	2006	DBLP DOI BibTeX RDF	Chordal sense of direction, Cayley graphs, Circulant graphs
39	Gisella Paoletti, Sara Rigutti	Texts and Graphs Elaboration: The Effect of Graphs' Examination on Recall.	Diagrams	2008	DBLP DOI BibTeX RDF	spatial contiguity effect, pop-up windows, learning, graphs, texts, recall
39	Erich Grädel, Lukasz Kaiser, Roman Rabinovich 0001	Directed Graphs of Entanglement Two.	FCT	2009	DBLP DOI BibTeX RDF
39	Stanko Dimitrov, Parameshwaran Krishnan, Colin L. Mallows, Jean Meloche, Shalini Yajnik	r3: Resilient Random Regular Graphs.	DISC	2008	DBLP DOI BibTeX RDF
39	Kathie Cameron, Pavol Hell	Independent packings in structured graphs.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 20E28, 20G40, 20C20
39	Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter	Proper Helly Circular-Arc Graphs.	WG	2007	DBLP DOI BibTeX RDF	Helly circular-arc graphs, proper circular-arc graphs, unit circular-arc graphs, algorithms, forbidden subgraphs
38	Ryuhei Uehara, Yushi Uno	Laminar Structure of Ptolemaic Graphs and Its Applications.	ISAAC	2005	DBLP DOI BibTeX RDF	algorithmic graph theory, intersection model, ptolemaic graphs, data structure, Hamiltonian cycle
37	Bruno Escoffier, Laurent Gourvès, Jérôme Monnot	Complexity and Approximation Results for the Connected Vertex Cover Problem.	WG	2007	DBLP DOI BibTeX RDF	Connected vertex cover, APX-complete, approximation algorithm, planar graphs, bipartite graphs, chordal graphs
37	Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Amutha Alaguvel	Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs.	WG	2003	DBLP DOI BibTeX RDF
37	Denis Xavier Charles, Kristin E. Lauter, Eyal Z. Goren	Cryptographic Hash Functions from Expander Graphs.	J. Cryptol.	2009	DBLP DOI BibTeX RDF	Supersingular elliptic curves, Elliptic curve cryptography, Expander graphs, Cryptographic hash functions, Ramanujan graphs, Isogenies
37	Min Chih Lin, Jayme Luiz Szwarcfiter	Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs.	COCOON	2006	DBLP DOI BibTeX RDF	Helly circular-arc graphs, algorithms, forbidden subgraphs, circular-arc graphs
37	Luigi P. Cordella, Pasquale Foggia, Carlo Sansone, Mario Vento	A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs.	IEEE Trans. Pattern Anal. Mach. Intell.	2004	DBLP DOI BibTeX RDF	Graph-subgraph isomorphism, attributed relational graphs, large graphs
37	Cyril Gavoille, Christophe Paul	Optimal Distance Labeling for Interval and Circular-Arc Graphs.	ESA	2003	DBLP DOI BibTeX RDF	distance queries, Data-structure, interval graphs, labeling scheme, circular-arc graphs
37	Ryuhei Uehara	Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs.	ICALP	2002	DBLP DOI BibTeX RDF	Chordal bipartite graphs, lexicographic breadth first search, vertex elimination ordering, strongly chordal graphs, design and analysis of algorithms
37	Cornelis Hoede, X. Liu	Word Graphs: The Second Set.	ICCS	1998	DBLP DOI BibTeX RDF	Knowledge graphs, adverbs, AMS Subject Classifications: 05C99, 68F99, classifiers, adjectives, word graphs
37	Nabil Kahalé	Eigenvalues and Expansion of Regular Graphs.	J. ACM	1995	DBLP DOI BibTeX RDF	induced subgraphs, selection networks, load balancing, random walks, eigenvalues, expander graphs, Ramanujan graphs
36	Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi	Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs.	ICALP (1)	2009	DBLP DOI BibTeX RDF
36	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
36	Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen	lambda-Coloring of Graphs.	STACS	2000	DBLP DOI BibTeX RDF
36	Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai	Homogeneously Orderable Graphs and the Steiner Tree Problem.	WG	1995	DBLP DOI BibTeX RDF
36	Ching-Chy Wang, Errol L. Lloyd, Mary Lou Soffa	Feedback Vertex Sets and Cyclically Reducible Graphs	J. ACM	1985	DBLP DOI BibTeX RDF
36	Herbert Fleischner, Stefan Szeider	On Edge-Colored Graphs Covered by Properly Colored Cycles.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	Properly colored cycles, 1-Extendable graphs, Cycle covers, Edge-colored graphs
36	Frank Gurski, Egon Wanke	On Module-Composed Graphs.	WG	2009	DBLP DOI BibTeX RDF	special graph classes, homogeneous sets, HHDS-free graphs, bipartite graphs, distance hereditary graphs
35	Guillaume Fertin, André Raspaud, Bruce A. Reed	On Star Coloring of Graphs.	WG	2001	DBLP DOI BibTeX RDF	proper coloring, star coloring, acyclic coloring, graphs, treewidth, vertex coloring
35	Ryuhei Uehara	Bandwidth of Bipartite Permutation Graphs.	ISAAC	2008	DBLP DOI BibTeX RDF	bipartite permutation graphs, chain graphs, threshold graphs, Bandwidth, interval graphs
35	Philip N. Klein, Sairam Subramanian	A linear-processor polylog-time algorithm for shortest paths in planar graphs	FOCS	1993	DBLP DOI BibTeX RDF	linear-processor polylog-time algorithm, directed planar graphs, bounded-genus graphs, 2-dimensional overlap graphs, shortest paths, planar graphs, separators, decomposition tree
35	Sriram V. Pemmaraju, Rajiv Raman 0001	Approximation Algorithms for the Max-coloring Problem.	ICALP	2005	DBLP DOI BibTeX RDF
35	Bruno Courcelle	Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas.	RTA	1999	DBLP DOI BibTeX RDF
34	Sriram V. Pemmaraju, Imran A. Pirwani	Energy conservation via domatic partitions.	MobiHoc	2006	DBLP DOI BibTeX RDF	domatic partition, growth-bounded graphs, distributed algorithms, metric space, dominating sets, unit disk graphs, maximal independent sets, network decomposition, doubling dimension, unit ball graphs
34	Laurenz Wiskott, Jean-Marc Fellous, Norbert Krüger, Christoph von der Malsburg	Face Recognition by Elastic Bunch Graph Matching.	ICIP (1)	1997	DBLP DOI BibTeX RDF	elastic bunch graph matching, labeled graphs, elastic graph matching process, phase information, node positioning, object-adapted graphs, image graph extraction, sample image graphs, data structure, face recognition, face recognition, rotations, similarity function, human faces, Gabor wavelet transform
34	Peter Eades, Qing-Wen Feng, Xuemin Lin 0001, Hiroshi Nagamochi	Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs.	Algorithmica	2006	DBLP DOI BibTeX RDF	Automatic graph drawing, Computational geometry, Hierarchical graph, Clustered graph, Straight-line drawing
34	Michael Kaufmann 0001, Jan Kratochvíl, Katharina Anna Lehmann, Amarendran Ramaswami Subramanian	Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition.	SODA	2006	DBLP DOI BibTeX RDF
34	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs.	ACM Trans. Algorithms	2005	DBLP DOI BibTeX RDF	(k, r)-center, planar graph, domination, fixed-parameter algorithms, map graph
34	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs.	ICALP	2003	DBLP DOI BibTeX RDF
34	Garth Isaak	Sum List Coloring Block Graphs.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Sum coloring, Block graphs, List coloring
34	Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton	Oblivious routing on node-capacitated and directed graphs.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	node-capacitated graphs, directed graphs, communication networks, Oblivious routing
34	Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia	Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs.	SIROCCO	2007	DBLP DOI BibTeX RDF	Edge Colouring, Wedge, Wireless Network, Location Awareness, Local Algorithm, Unit Disk Graphs, Geometric Graphs
34	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
34	Cornelis Hoede, L. Zhang	Word Graphs: The Third Set.	ICCS	2001	DBLP DOI BibTeX RDF	Knowledge graphs, logic word, ontology. skip AMS Subject Classifications: 05C99, 68F99, classification, word graphs
34	Tiziana Calamoneri, Rossella Petreschi	L(2, 1)-labeling of planar graphs.	DIAL-M	2001	DBLP DOI BibTeX RDF	L(2, 1)-labeling, planar graphs, outerplanar graphs, multi-hop radio networks
34	Bharat P. Dave, Niraj K. Jha	CASPER: Concurrent Hardware-Software Co-Synthesis of Hard Real-Time Aperiodic and Periodic Specifications of Embedded System Architectures.	DATE	1998	DBLP DOI BibTeX RDF	aperiodic task graphs, scheduling, distributed systems, embedded systems, allocation, system synthesis, hardware-software co-synthesis
33	Seok-Hee Hong 0001, Peter Eades	Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs.	Algorithmica	2006	DBLP DOI BibTeX RDF	Planar geometric automorphisms, Symmetry, Graph drawing, Planar graphs
33	Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach	Spanners in Sparse Graphs.	ICALP (1)	2008	DBLP DOI BibTeX RDF
33	Robert D. Kleinberg, Jon M. Kleinberg	Isomorphism and embedding problems for infinite limits of scale-free graphs.	SODA	2005	DBLP BibTeX RDF
33	Alexander Gamburd, Igor Pak	Expansion of product replacement graphs.	SODA	2002	DBLP BibTeX RDF
33	Julia Padberg, Hartmut Ehrig, Grzegorz Rozenberg	Behavior and Realization Construction for Petri Nets Based on Free Monoid and Power Set Graphs.	Unifying Petri Nets	2001	DBLP DOI BibTeX RDF	place/transition nets, elementary nets, uniform approach, realization problem, category theory
33	Shien-Ching Hwang, Gen-Huey Chen	The Minimum Spanner Problem on Butterfly Graphs.	ISPAN	2000	DBLP DOI BibTeX RDF
33	Maciej M. Syslo	On Some Generalizations of Outerplanar Graphs: Results and Open Problems.	WG	1986	DBLP DOI BibTeX RDF
33	Alain Bretto, Luc Gillibert	G-graphs for the cage problem: a new upper bound.	ISSAC	2007	DBLP DOI BibTeX RDF	G-graphs, cage graphs, graphs from group
33	Yonatan Bilu, Nathan Linial	Constructing Expander Graphs by 2-Lifts and Discrepancy vs. Spectral Gap.	FOCS	2004	DBLP DOI BibTeX RDF	Lifts of Graphs, Signed Graphs, Expander Graphs, Discrepancy, Lifts
33	Hans L. Bodlaender	Necessary Edges in k-Chordalisations of Graphs.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	triangulated graphs, graph algorithms, interval graphs, treewidth, chordal graphs, pathwidth
33	Steven Gold, Anand Rangarajan 0001	A Graduated Assignment Algorithm for Graph Matching.	IEEE Trans. Pattern Anal. Mach. Intell.	1996	DBLP DOI BibTeX RDF	Graduated assignment, graph matching, weighted graphs, relaxation labeling, attributed relational graphs, model matching, continuation method, softassign
32	Khoriba Ghada, Jie Li 0002, Yusheng Ji	Localized Mobility-Aware Geometric Graphs for Topology Control in Heterogeneous Mobile Ad Hoc Networks.	DNIS	2007	DBLP DOI BibTeX RDF	Heterogeneous Transmission range, Mobile Ad Hoc Networks, Topology control, Graph connectivity, Geometric graphs
32	John G. Stell	Granulation for Graphs.	COSIT	1999	DBLP DOI BibTeX RDF	Graphs, Formal Models, Granularity, Multi-resolution, Vagueness, Spatial Partitions
32	Peter Hui, Michael J. Pelsmajer, Marcus Schaefer 0001, Daniel Stefankovic	Train Tracks and Confluent Drawings.	Algorithmica	2007	DBLP DOI BibTeX RDF
32	John T. Rickard, Ronald R. Yager	Hypercube Graph Representations and Fuzzy Measures of Graph Properties.	IEEE Trans. Fuzzy Syst.	2007	DBLP DOI BibTeX RDF
32	Narayan Vikas	Connected and Loosely Connected List Homomorphisms.	WG	2002	DBLP DOI BibTeX RDF
31	Stavros D. Nikolopoulos, Charis Papadopoulos	The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Complement spanning-tree matrix theorem, Quasi-threshold graphs, Networks, Trees, Spanning trees, Combinatorial problems
31	Jiong Guo, Rolf Niedermeier, Daniel Raible 0001	Improved Algorithms and Complexity Results for Power Domination in Graphs.	Algorithmica	2008	DBLP DOI BibTeX RDF	Graphs of bounded treewidth, (Power) domination in graphs, Computational complexity, Graph algorithms, Parameterized complexity, Design and analysis of algorithms, Fixed-parameter algorithms
31	Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca	Independent Sets of Maximum Weight in Apple-Free Graphs.	ISAAC	2008	DBLP DOI BibTeX RDF	clique separators, apple-free graphs, polynomial-time algorithm, Maximum independent set, modular decomposition, claw-free graphs
31	Ryuhei Uehara	Simple Geometrical Intersection Graphs.	WALCOM	2008	DBLP DOI BibTeX RDF	grid intersection graphs, graph isomorphism, interval graphs, Hamiltonian path problem
31	Stavros D. Nikolopoulos, Leonidas Palios	An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs.	FAW	2007	DBLP DOI BibTeX RDF	HHD-free graphs, certifying algorithms, recognition, perfectly orderable graphs
31	Stavros D. Nikolopoulos, Leonidas Palios	Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching.	Panhellenic Conference on Informatics	2005	DBLP DOI BibTeX RDF	P4-sparse graphs, maximum-size subgraphs, perfect matching, maximum matchings, Perfect graphs, cographs