Search results for "chordal"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
144	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
111	Bernard Mans	On the Interval Routing of Chordal Rings.	ISPAN	1999	DBLP DOI BibTeX RDF	Interval Routing Scheme, Shortest Path, Graph Isomorphism, Circulant Graph, Chordal Ring
108	Pinar Heggernes, Federico Mancini 0001, Charis Papadopoulos, R. Sritharan	Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone.	COCOON	2009	DBLP DOI BibTeX RDF
100	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
94	Martin Charles Golumbic, Marina Lipshteyn	Chordal Probe Graphs.	WG	2003	DBLP DOI BibTeX RDF
94	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
89	Andreas Brandstädt, Chính T. Hoàng	Maximum Induced Matchings for Chordal Graphs in Linear Time.	Algorithmica	2008	DBLP DOI BibTeX RDF	Maximum induced matchings, Perfect elimination order, Lexicographic breadth-first search, Chordal graphs, Linear time algorithm
89	Behrooz Parhami, Ding-Ming Kwai	Periodically Regular Chordal Rings.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	hierarchical parallel architectures, skip links, fault tolerance, interconnection networks, routing algorithms, greedy routing, Chordal rings
84	William S. Kennedy, Guohui Lin	5-th Phylogenetic Root Construction for Strictly Chordal Graphs.	ISAAC	2005	DBLP DOI BibTeX RDF	phylogeny reconstruction, phylogenetic root, Steiner root, chordal, strictly chordal, Computational biology
82	Anita Das 0001, B. S. Panda 0001, Rajendra P. Lal	A linear time algorithm for constructing tree 3-spanner in simple chordal bipartite graphs.	ICIT	2006	DBLP DOI BibTeX RDF
82	Anne Berry, Martin Charles Golumbic, Marina Lipshteyn	Two tricks to triangulate chordal probe graphs in polynomial time.	SODA	2004	DBLP BibTeX RDF
82	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
82	Mário M. Freire, Henrique J. A. da Silva	Performance Comparison of Wavelength Routing Optical Networks with Chordal Ring and Mesh-Torus Topologies.	ICN (1)	2001	DBLP DOI BibTeX RDF
78	Philip Brisk, Ajay Kumar 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
78	Lata Narayanan, Jaroslav Opatrny	Compact Routing on Chordal Rings of Degree 4.	Algorithmica	1999	DBLP DOI BibTeX RDF	Compact routing schemes, Boolean routing, Distributed networks, Chordal rings, Interval routing
74	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
71	Pavol Hell, André Raspaud, Juraj Stacho	On Injective Colourings of Chordal Graphs.	LATIN	2008	DBLP DOI BibTeX RDF
71	Fedor V. Fomin, Martín Matamala, Ivan Rapaport	The Complexity of Approximating the Oriented Diameter of Chordal Graphs.	WG	2002	DBLP DOI BibTeX RDF
71	P. Sreenivasa Kumar, C. E. Veni Madhavan	A New Class of Separators and Planarity of Chordal Graphs.	FSTTCS	1989	DBLP DOI BibTeX RDF
68	Joel J. P. C. Rodrigues, Mário M. Freire, Pascal Lorenz	One-Way Resource Reservation Protocols for IP Over Optical Burst Switched Mesh Networks.	Systems Communications	2005	DBLP DOI BibTeX RDF
68	Narayan Vikas	Connected and Loosely Connected List Homomorphisms.	WG	2002	DBLP DOI BibTeX RDF
66	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
66	Yawen Chen 0001, Hong Shen 0001, Haibo Zhang 0001	Hypercube Communications on Optical Chordal Ring Networks with Chord Length of Three.	Asia-Pacific Computer Systems Architecture Conference	2006	DBLP DOI BibTeX RDF	hypercube communication, Wavelength Division Multiplexing (WDM), routing and wavelength assignment(RWA), chordal ring
66	Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti	Packing r-Cliques in Weighted Chordal Graphs.	Ann. Oper. Res.	2005	DBLP DOI BibTeX RDF	min-max theorems, linear programming duality, complementary slackness, greedy algorithms, chordal graphs
66	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
66	Yon Dourisboure, Cyril Gavoille	Improved Compact Routing Scheme for Chordal Graphs.	DISC	2002	DBLP DOI BibTeX RDF	Chordal graph, tree-decomposition, compact routing tables
66	Yon Dourisboure	An Additive Stretched Routing Scheme for Chordal Graphs.	WG	2002	DBLP DOI BibTeX RDF	Chordal graph, tree-decomposition, compact routing tables
66	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
60	Frank Kammer, Torsten Tholey	The k-Disjoint Paths Problem on Chordal Graphs.	WG	2009	DBLP DOI BibTeX RDF
60	Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno	On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints.	COCOON	2008	DBLP DOI BibTeX RDF
60	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
60	Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman 0001	Approximating Interval Coloring and Max-Coloring in Chordal Graphs.	WEA	2004	DBLP DOI BibTeX RDF
60	Joel J. P. C. Rodrigues, Mário M. Freire, Pascal Lorenz	Performance Assessment of Optical Burst Switched Degree-Four Chordal Ring Networks.	ICT	2004	DBLP DOI BibTeX RDF
60	Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti	List Partitions of Chordal Graphs.	LATIN	2004	DBLP DOI BibTeX RDF
60	Lali Barrière, Josep Fàbrega	Edge-Bisection of Chordal Rings.	MFCS	2000	DBLP DOI BibTeX RDF
60	Philippe Galinier, Michel Habib, Christophe Paul	Chordal Graphs and Their Clique Graphs.	WG	1995	DBLP DOI BibTeX RDF
56	Feodor F. Dragan, Martín Matamala	Navigating in a Graph by Aid of Its Spanning Tree.	ISAAC	2008	DBLP DOI BibTeX RDF
55	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
55	Ryan B. Hayward, Jeremy P. Spinrad, R. Sritharan	Improved algorithms for weakly chordal graphs.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	weakly chordal, graph algorithms, recognition, coloring, Perfect graphs
55	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
55	Jérôme Hulin, Edouard Thiel	Chordal Axis on Weighted Distance Transforms.	DGCI	2006	DBLP DOI BibTeX RDF	chordal axis, chamfer or weighted distances, image analysis, medial axis, shape description, discrete geometry
52	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.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05D05, 05C69
51	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
51	William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman	Augmented Ring Networks.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	express rings, hierarchical ring networks, diameter trade-offs, graph embedding, Ring networks, multirings, chordal rings, grid graphs
49	Michel Habib, Juraj Stacho	Polynomial-Time Algorithm for the Leafage of Chordal Graphs.	ESA	2009	DBLP DOI BibTeX RDF
49	Masashi Kiyomi, Shuji Kijima, Takeaki Uno	Listing Chordal Graphs and Interval Graphs.	WG	2006	DBLP DOI BibTeX RDF
49	Andrew R. Curtis, Clemente Izurieta, Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell	An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time.	WG	2006	DBLP DOI BibTeX RDF
49	Cornelia Dangelmayr, Stefan Felsner	Chordal Graphs as Intersection Graphs of Pseudosegments.	GD	2006	DBLP DOI BibTeX RDF
49	Yawen Chen 0001, Hong Shen 0001, Haibo Zhang 0001	Embedding Hypercube Communications on Optical Chordal Ring Networks.	LCN	2006	DBLP DOI BibTeX RDF
49	Andreas Brandstädt, Chính T. Hoàng	On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem.	IPCO	2005	DBLP DOI BibTeX RDF
49	Joel J. P. C. Rodrigues, Mário M. Freire, Pascal Lorenz	Performance Assessment of Optical Burst Switching Ring and Chordal Ring Networks.	Telecommun. Syst.	2004	DBLP DOI BibTeX RDF	optical Internet, performance, optical burst switching, signaling protocols
49	Anne Berry, Pinar Heggernes, Yngve Villanger	A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs.	ISAAC	2003	DBLP DOI BibTeX RDF
49	Celina M. H. de Figueiredo, Frédéric Maffray, Oscar Porto	On the Structure of Bull-Free Perfect Graphs, 2: the Weakly Chordal Case.	Graphs Comb.	2001	DBLP DOI BibTeX RDF
49	Hiroshi Masuyama, Hiroshi Taniguchi, Tsutomu Miyoshi	All-to-All Personalized Communication Algorithms in Chordal Ring Networks.	ICN (2)	2001	DBLP DOI BibTeX RDF
49	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
49	Elias Dahlhaus	Minimal Elimination Ordering Inside a Given Chordal Graph.	WG	1997	DBLP DOI BibTeX RDF
49	Victor Chepoi, Feodor F. Dragan	A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph.	ESA	1994	DBLP DOI BibTeX RDF
49	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
47	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
45	Martin Maier 0001, Martin Herzog	Long-lifetime capacity upgrades of ring networks for unpredictable traffic.	IEEE J. Sel. Areas Commun.	2007	DBLP DOI BibTeX RDF
45	Joel J. P. C. Rodrigues, Mário M. Freire, Pascal Lorenz	Performance Implications of Meshing Degree for Optical Burst Switched Networks Using One-Way Resource Reservation Protocols.	Telecommun. Syst.	2005	DBLP DOI BibTeX RDF	optical internet, performance, optical burst switching, resource reservation protocols
45	Christophe Paul, Jan Arne Telle	New Tools and Simpler Algorithms for Branchwidth.	ESA	2005	DBLP DOI BibTeX RDF
45	Joel J. P. C. Rodrigues, Mário M. Freire, Pascal Lorenz	The Role of Meshing Degree in Optical Burst Switching Networks Using Signaling Protocols with One-Way Reservation Schemes.	ICN (1)	2005	DBLP DOI BibTeX RDF
45	Feodor F. Dragan	Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach.	WG	2001	DBLP DOI BibTeX RDF
45	Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt	LexBFS-Orderings and Power of Graphs.	WG	1996	DBLP DOI BibTeX RDF
45	Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan	The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings.	WG	1994	DBLP DOI BibTeX RDF
45	Terry A. McKee	Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs.	Discret. Math.	2003	DBLP DOI BibTeX RDF
44	Lilian Markenzon, Oswaldo Vernet, Luiz Henrique Araujo	Two methods for the generation of chordal graphs.	Ann. Oper. Res.	2008	DBLP DOI BibTeX RDF	Clique-tree, Chordal graphs, Dynamic algorithms, Graph generation
44	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
44	William Roshan Quadros	An approach for extracting non-manifold mid-surfaces of thin-wall solids using chordal axis transform.	Eng. Comput.	2008	DBLP DOI BibTeX RDF	Chordal axis transform, Mid-surface extraction, Midplane mesh generation, Medial axis transform
44	Luitpold Babel	Isomorphism of Chordal (6, 3) Graphs.	Computing	1995	DBLP DOI BibTeX RDF	automorphism partition, graphs with fewP 4s, Graph isomorphism, chordal graphs, polynomial algorithm
41	Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern	What Is between Chordal and Weakly Chordal Graphs?.	WG	2008	DBLP DOI BibTeX RDF
41	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
40	Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton	Maximum Cardinality Search for Computing Minimal Triangulations of Graphs.	Algorithmica	2004	DBLP DOI BibTeX RDF	Minimal triangulations, Minimal elimination ordering, Minimal fill, Chordal graphs
40	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
40	Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara	Tree Spanners for Bipartite Graphs and Probe Interval Graphs.	WG	2003	DBLP DOI BibTeX RDF	Chordal bipartite graph, Interval bigraph, Probe interval graph, Tree spanner, NP-completeness
40	Carmen Martínez, Ramón Beivide, Jaime Gutierrez 0001, Cruz Izu	Distance-Hereditary Embeddings of Circulant Graphs.	ITCC	2003	DBLP DOI BibTeX RDF	Ádam´s Conjecture, Cycles, Graph Embedding, Circulant graphs, Chordal Rings
37	Douglas E. Carroll, Adam Meyerson, Brian Tagiku	Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
37	Juraj Stacho	On 2-Subcolourings of Chordal Graphs.	LATIN	2008	DBLP DOI BibTeX RDF
37	Tursunbay kyzy Yrysgul	A Fully Dynamic Algorithm for Recognizing and Representing Chordal Graphs.	Ershov Memorial Conference	2006	DBLP DOI BibTeX RDF
37	Martin Charles Golumbic, Marina Lipshteyn, Michal Stern	Finding Intersection Models of Weakly Chordal Graphs.	WG	2006	DBLP DOI BibTeX RDF
37	Dániel Marx	Chordal Deletion Is Fixed-Parameter Tractable.	WG	2006	DBLP DOI BibTeX RDF
37	Paola Flocchini, Miao Jim Huang, Flaminia L. Luccio	Decontamination of chordal rings and tori.	IPDPS	2006	DBLP DOI BibTeX RDF
37	Fernando Magno Quintão Pereira, Jens Palsberg	Register Allocation Via Coloring of Chordal Graphs.	APLAS	2005	DBLP DOI BibTeX RDF
37	Yon Dourisboure	Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs.	DISC	2004	DBLP DOI BibTeX RDF	tree-length, chordality, compact routing, tree-decomposition
37	Dániel Marx	Parameterized Coloring Problems on Chordal Graphs.	IWPEC	2004	DBLP DOI BibTeX RDF
37	Takayuki Nagoya	Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number.	ISAAC	2001	DBLP DOI BibTeX RDF
37	Maw-Shang Chang	Algorithms for Maximum Matching and Minimum Fill-in on Chordal Bipartite Graphs.	ISAAC	1996	DBLP DOI BibTeX RDF
37	Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin	Dually Chordal Graphs.	WG	1993	DBLP DOI BibTeX RDF
34	Yuli Ye, Allan Borodin	Elimination Graphs.	ICALP (1)	2009	DBLP DOI BibTeX RDF
34	Julian J. 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
34	Joel J. P. C. Rodrigues, Mário M. Freire	Performance Assessment of Signaling Protocols in Optical Burst Switching Mesh Networks.	ICOIN	2004	DBLP DOI BibTeX RDF
34	Feodor F. Dragan, Chenyu Yan, Irina Lomonosov	Collective Tree Spanners of Graphs.	SWAT	2004	DBLP DOI BibTeX RDF
34	Rui M. F. Coelho, Mário M. Freire	Optical Backbones with Low Connectivity for IP-over-WDM Networks.	ICOIN (1)	2002	DBLP DOI BibTeX RDF
34	Chin Lung Lu, Sheng-Lung Peng, Chuan Yi Tang	Efficient Minus and Signed Domination in Graphs.	ISAAC	2000	DBLP DOI BibTeX RDF
34	Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul	Diameter Determination on Restricted Graph Faminlies.	WG	1998	DBLP DOI BibTeX RDF
34	Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi 0001	Parallelizing Elimination Orders with Linear Fill.	FOCS	1997	DBLP DOI BibTeX RDF
34	Petr Hlinený, Jan Kratochvíl	Computational Complexity of the Krausz Dimension of Graphs.	WG	1997	DBLP DOI BibTeX RDF
34	Feodor F. Dragan, Andreas Brandstädt	Dominating Cliques in Graphs with Hypertree Structures.	STACS	1994	DBLP DOI BibTeX RDF
34	Ton Kloks, Dieter Kratsch	Treewidth of Bipartite Graphs.	STACS	1993	DBLP DOI BibTeX RDF