Search results for "chordal graph"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Yasuko Matsui, Ryuhei Uehara, Takeaki Uno	Enumeration of Perfect Sequences of Chordal Graph.	ISAAC	2008	DBLP DOI BibTeX RDF	clique tree, perfect sequence, enumeration, Chordal graph
2	Dan Gusfield	The Multi-State Perfect Phylogeny Problem with Missing and Removable Data: Solutions via Integer-Programming and Chordal Graph Theory.	RECOMB	2009	DBLP DOI BibTeX RDF	graph triangulation, integer programming, computational biology, chordal graphs, phylogenetics, perfect phylogeny
2	Philip Brisk, Ajay K. Verma, Paolo Ienne	An optimistic and conservative register assignment heuristic for chordal graphs.	CASES	2007	DBLP DOI BibTeX RDF	static single assignment (ssa) form, chordal graph, register assignment
2	Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara	Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs.	WG	2005	DBLP DOI BibTeX RDF	# P-completeness, NP-completeness, polynomial time algorithm, enumeration, independent set, Chordal graph, counting
2	Yon Dourisboure, Cyril Gavoille	Improved Compact Routing Scheme for Chordal Graphs.	DISC	2002	DBLP DOI BibTeX RDF	Chordal graph, tree-decomposition, compact routing tables
2	Yon Dourisboure	An Additive Stretched Routing Scheme for Chordal Graphs.	WG	2002	DBLP DOI BibTeX RDF	Chordal graph, tree-decomposition, compact routing tables
2	L. Sunil Chandran	A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph.	COCOON	2001	DBLP DOI BibTeX RDF
2	Elias Dahlhaus	Minimal Elimination Ordering Inside a Given Chordal Graph.	WG	1997	DBLP DOI BibTeX RDF
2	Victor Chepoi, Feodor F. Dragan	A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph.	ESA	1994	DBLP DOI BibTeX RDF
1	Pablo De Caria, Marisa Gutierrez	Determining what sets of trees can be the clique trees of a chordal graph.	J. Braz. Comp. Soc.	2012	DBLP DOI BibTeX RDF
1	Anne Berry, Romain Pogorelcnik	A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph.	Inf. Process. Lett.	2011	DBLP DOI BibTeX RDF
1	Rob Gysel, Dan Gusfield	Extensions and Improvements to the Chordal Graph Approach to the Multistate Perfect Phylogeny Problem.	IEEE/ACM Trans. Comput. Biology Bioinform.	2011	DBLP DOI BibTeX RDF
1	Petr A. Golovach, Marcin Kaminski, Daniël Paulusma	Contracting a Chordal Graph to a Split Graph or a Tree.	MFCS	2011	DBLP DOI BibTeX RDF
1	Yasuko Matsui, Ryuhei Uehara, Takeaki Uno	Enumeration of the perfect sequences of a chordal graph.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
1	Junfeng Jin, Yusheng Ji, Baohua Zhao, Hao Zhou	Chordal Graph Based Channel Assignment for Multicast and Unicast Traffic in Wireless Mesh Networks.	IEICE Transactions	2010	DBLP BibTeX RDF
1	Rob Gysel, Dan Gusfield	Extensions and Improvements to the Chordal Graph Approach to the Multi-state Perfect Phylogeny Problem.	ISBRA	2010	DBLP DOI BibTeX RDF
1	Hongbo Rong	Tree register allocation.	MICRO	2009	DBLP DOI BibTeX RDF	register allocation, chordal graph
1	Andreas Brandstädt, Raffaele Mosca	On Distance-3 Matchings and Induced Matchings.	Graph Theory, Computational Intelligence and Thought	2009	DBLP DOI BibTeX RDF	Distance-k matching, Maximum Distance-k Matching Problem, Maximum Induced Matching Problem, chordal graphs
1	Michel Habib, Juraj Stacho	Polynomial-Time Algorithm for the Leafage of Chordal Graphs.	ESA	2009	DBLP DOI BibTeX RDF
1	Florent Bouchez, Alain Darte, Fabrice Rastello	Advanced conservative and optimistic register coalescing.	CASES	2008	DBLP DOI BibTeX RDF	coloring number, greedy-k-colorable graph, register allocation, chordal graph, register coalescing
1	Jirí Fiala, Petr A. Golovach	Complexity of the Packing Coloring Problem for Trees.	WG	2008	DBLP DOI BibTeX RDF	Packing coloring, computational complexity, graph algorithm, chordal graph
1	Bostjan Bresar, Manoj Changat, Sandi Klavzar, Matjaz Kovse, Joseph Mathews, Antony Mathews	Cover-Incomparability Graphs of Posets.	Order	2008	DBLP DOI BibTeX RDF	Underlying graph, Transit function, Claw, Poset, Chordal graph, Distance-hereditary graph
1	Louis Ibarra	Fully dynamic algorithms for chordal graphs and split graphs.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	clique trees, split graphs, chordal graphs, Dynamic graph algorithms
1	Thierry Vallée, Alain Bretto	Hamiltonicity of Simplicial-Connected Graphs: An Algorithm Based on Clique Decomposition.	ITNG	2008	DBLP DOI BibTeX RDF	Clique Covering, Network, Graph Theory, Graph Algorithms, Hamiltonicity
1	Julian John McAuley, Tibério S. Caetano, Marconi S. Barbosa	Graph Rigidity, Cyclic Belief Propagation, and Point Pattern Matching.	IEEE Trans. Pattern Anal. Mach. Intell.	2008	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger	Faster Parameterized Algorithms for Minimum Fill-In.	ISAAC	2008	DBLP DOI BibTeX RDF
1	Feodor F. Dragan, Martín Matamala	Navigating in a Graph by Aid of Its Spanning Tree.	ISAAC	2008	DBLP DOI BibTeX RDF
1	Andreas Brandstädt, Christian Hundt	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
1	Pavol Hell, André Raspaud, Juraj Stacho	On Injective Colourings of Chordal Graphs.	LATIN	2008	DBLP DOI BibTeX RDF
1	Juraj Stacho	On 2-Subcolourings of Chordal Graphs.	LATIN	2008	DBLP DOI BibTeX RDF
1	Jürgen Herzog, Satoshi Murai, Xinxian Zheng, Takayuki Hibi, Ngô Viêt Trung	Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs.	Combinatorica	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05D05, 05C69
1	Nobuo Yamashita	Sparse quasi-Newton updates with positive definite matrix completion.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C53, 90C06
1	Yu-Ping Tsao, Gerard J. Chang	Profile minimization on compositions of graphs.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Simplicial vertex, Composition, Profile, Cycle, Join, Interval graph, Chordal graph
1	Petr A. Golovach, Jan Kratochvíl	Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs.	WG	2007	DBLP DOI BibTeX RDF	Computational complexity, graph algorithms
1	Daniel Meister	A Characterisation of the Minimal Triangulations of Permutation Graphs.	WG	2007	DBLP DOI BibTeX RDF
1	Hisayuki Hara, Akimichi Takemura	Boundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph	CoRR	2006	DBLP BibTeX RDF
1	Atif A. Abueida, R. Sritharan	Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes.	SIAM J. Discrete Math.	2006	DBLP DOI BibTeX RDF
1	Douglas Bauer, Hajo Broersma, Edward F. Schmeichel	Toughness in Graphs - A Survey.	Graphs and Combinatorics	2006	DBLP DOI BibTeX RDF	Toughness, t-tough graph, Traceable graph, Circumference, k-factor, Triangle-free graph, Computational complexity, Factor, Planar graph, Chordal graph, Hamiltonian graph, Hamilton cycle
1	Philip Brisk, Foad Dabiri, Roozbeh Jafari, Majid Sarrafzadeh	Optimal register sharing for high-level synthesis of SSA form programs.	IEEE Trans. on CAD of Integrated Circuits and Systems	2006	DBLP DOI BibTeX RDF
1	Tursunbay kyzy Yrysgul	A Fully Dynamic Algorithm for Recognizing and Representing Chordal Graphs.	Ershov Memorial Conference	2006	DBLP DOI BibTeX RDF
1	Mahnhoon Lee, Sridhar Radhakrishnan	Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph.	Discrete Applied Mathematics	2005	DBLP DOI BibTeX RDF
1	Xijuan Guo, Huiping Yao, Fang Cheng	Inverse M-matrices completions of the n-chordal graph.	Int. J. Comput. Math.	2005	DBLP DOI BibTeX RDF
1	Fernando Magno Quintão Pereira, Jens Palsberg	Register Allocation Via Coloring of Chordal Graphs.	APLAS	2005	DBLP DOI BibTeX RDF
1	Xiaomin Chen, Mario Szegedy, Lei Wang	Optimally Balanced Forward Degree Sequence.	COCOON	2005	DBLP DOI BibTeX RDF
1	Christophe Paul, Jan Arne Telle	New Tools and Simpler Algorithms for Branchwidth.	ESA	2005	DBLP DOI BibTeX RDF
1	Anne Berry, Richard Krueger, Geneviève Simonet	Ultimate Generalizations of LexBFS and LEX M.	WG	2005	DBLP DOI BibTeX RDF
1	Anne Berry, Alain Sigayret, Jeremy Spinrad	Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny.	WG	2005	DBLP DOI BibTeX RDF
1	Daniel Meister	Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time.	WG	2005	DBLP DOI BibTeX RDF
1	Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti	Packing r-Cliques in Weighted Chordal Graphs.	Annals OR	2005	DBLP DOI BibTeX RDF	min-max theorems, linear programming duality, complementary slackness, greedy algorithms, chordal graphs
1	Santos Hernández, Florian Luca	Integer Roots Chromatic Polynomials of Non-Chordal Graphs and the Prouhet-Tarry-Escott Problem.	Graphs and Combinatorics	2005	DBLP DOI BibTeX RDF	Chromatic polynomials of graphs, the Prouhet-Tarry-Escott problem
1	Raul Cordovil, David Forge, Sulamita Klein	How is a chordal graph like a supersolvable binary matroid?	Discrete Mathematics	2004	DBLP DOI BibTeX RDF
1	Lap Chi Lau, Derek G. Corneil	Recognizing Powers of Proper Interval, Split, and Chordal Graph.	SIAM J. Discrete Math.	2004	DBLP DOI BibTeX RDF
1	Stavros D. Nikolopoulos, Leonidas Palios	Hole and antihole detection in graphs.	SODA	2004	DBLP DOI BibTeX RDF	antihole, co-connectivity, weakly chordal graph, hole
1	Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle	Graph Searching, Elimination Trees, and a Generalization of Bandwidth.	Algorithmica	2004	DBLP DOI BibTeX RDF	Bandwidth, Chordal graph, Graph searching, Tree decomposition, Elimination tree
1	Anne Berry, Martin Charles Golumbic, Marina Lipshteyn	Two tricks to triangulate chordal probe graphs in polynomial time.	SODA	2004	DBLP DOI BibTeX RDF
1	L. Sunil Chandran, N. S. Narayanaswamy	On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts.	COCOON	2004	DBLP DOI BibTeX RDF
1	Feodor F. Dragan, Chenyu Yan, Irina Lomonosov	Collective Tree Spanners of Graphs.	SWAT	2004	DBLP DOI BibTeX RDF
1	L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada	Generating and characterizing the perfect elimination orderings of a chordal graph.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
1	Victor Chepoi, Feodor F. Dragan, Chenyu Yan	Additive Spanners for k-Chordal Graphs.	CIAC	2003	DBLP DOI BibTeX RDF
1	Anne Berry, Pinar Heggernes, Yngve Villanger	A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs.	ISAAC	2003	DBLP DOI BibTeX RDF
1	Martin Charles Golumbic, Marina Lipshteyn	Chordal Probe Graphs.	WG	2003	DBLP DOI BibTeX RDF
1	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
1	John G. Del Greco, Chandra N. Sekharan, R. Sridhar	Fast Parallel Reordering and Isomorphism Testing of k-Trees.	Algorithmica	2002	DBLP DOI BibTeX RDF	Isomorphism testing, Parallel algorithms, Chordal graph, Reordering, k -Tree
1	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
1	Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le	Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems.	ISAAC	2002	DBLP DOI BibTeX RDF
1	Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy	Optimal Algorithm for a Special Point-Labeling Problem.	SWAT	2002	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Martín Matamala, Ivan Rapaport	The Complexity of Approximating the Oriented Diameter of Chordal Graphs.	WG	2002	DBLP DOI BibTeX RDF
1	George E. Andrews, Arnold Knopfmacher	An Algorithmic Approach to Discovering and Proving q-Series Identities.	Algorithmica	2001	DBLP DOI BibTeX RDF	Isomorphism testing, Parallel algorithms, Chordal graph, Reordering, k -Tree
1	Takayuki Nagoya	Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number.	ISAAC	2001	DBLP DOI BibTeX RDF
1	Ryan Hayward, Jeremy Spinrad, R. Sritharan	Weakly chordal graph algorithms via handles.	SODA	2000	DBLP DOI BibTeX RDF
1	Edson Cáceres, Albert Chan, Frank K. H. A. Dehne, Giuseppe Prencipe	Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs.	WG	2000	DBLP DOI BibTeX RDF
1	Andreas Parra, Petra Scheffler	Characterizations and Algorithmic Applications of Chordal Graph Embeddings.	Discrete Applied Mathematics	1997	DBLP DOI BibTeX RDF
1	Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi	Parallelizing Elimination Orders with Linear Fill.	FOCS	1997	DBLP DOI BibTeX RDF
1	Klaus Jansen	The Optimum Cost Chromatic Partition Problem.	CIAC	1997	DBLP DOI BibTeX RDF
1	Elias Dahlhaus	Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs.	STACS	1997	DBLP DOI BibTeX RDF	Parallel Algorithms, Algorithms and Data Structures
1	Petr Hlinený, Jan Kratochvíl	Computational Complexity of the Krausz Dimension of Graphs.	WG	1997	DBLP DOI BibTeX RDF
1	Thomas Andreae, Carsten Flotow	On covering all cliques of a chordal graph.	Discrete Mathematics	1996	DBLP DOI BibTeX RDF
1	Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt	LexBFS-Orderings and Power of Graphs.	WG	1996	DBLP DOI BibTeX RDF
1	Philippe Galinier, Michel Habib, Christophe Paul	Chordal Graphs and Their Clique Graphs.	WG	1995	DBLP DOI BibTeX RDF
1	Frank Harary, Terry A. McKee	The square of a chordal graph.	Discrete Mathematics	1994	DBLP DOI BibTeX RDF
1	Stavros D. Nikolopoulos	Parallel Recognition and Location Algorithms for Chordal Graphs Using Distance Matrices.	CONPAR	1994	DBLP DOI BibTeX RDF	Parallel algorithms, Complexity, Recognition, Graph partition, Chordal graphs, Maximal cliques, Distance matrix
1	Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu	On Domination Elimination Orderings and Domination Graphs (Extended Abstract).	WG	1994	DBLP DOI BibTeX RDF
1	Nai-Wei Lin	Approximating the Chromatic Polynomial of a Graph.	WG	1993	DBLP DOI BibTeX RDF
1	P. Sreenivasa Kumar, C. E. Veni Madhavan	A New Class of Separators and Planarity of Chordal Graphs.	FSTTCS	1989	DBLP DOI BibTeX RDF
1	N. Chandrasekharan, S. Sitharama Iyengar	NC Algorithms for Recognizing Chordal Graphs and k Trees.	IEEE Trans. Computers	1988	DBLP DOI BibTeX RDF	chordal graph recognition, parallel algorithms, parallel algorithms, graph theory, trees (mathematics), PRAM, k trees, NC algorithms
1	Rajeev Motwani, Arvind Raghunathan, Huzur Saran	Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach.	Symposium on Computational Geometry	1988	DBLP DOI BibTeX RDF
1	S. V. Krishnan, C. Pandu Rangan, S. Seshadri	A New Linear Algorithm for the Two Path Problem on Chordal Graphs.	FSTTCS	1988	DBLP DOI BibTeX RDF
1	Anders Edenbrandt	Chordal Graph Recognition is in NC.	Inf. Process. Lett.	1987	DBLP DOI BibTeX RDF
1	Fanica Gavril	Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph.	SIAM J. Comput.	1972	DBLP DOI BibTeX RDF