Complete bipartite graph

Results: 71



#Item
1Graph theory / Bipartite graphs / Planar graphs / Induced path / NP-complete problems / Parity graph

Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2012-01-04 04:27:26
2Graph theory / Bipartite graphs / Graph operations / NP-complete problems / Chordal bipartite graph / Chordal graph / Distance-hereditary graph / Matching / Line graph / Split graph / Graph / Cycle

On factorial properties of chordal bipartite graphs Konrad Dabrowski∗ Vadim V. Lozin† Victor Zamaraev‡

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2013-01-06 11:50:35
3Graph theory / Mathematics / NP-complete problems / Graph coloring / Matching / Bipartite graph / Color-coding / Treewidth / Graph / Cycle / Line graph / Chromatic polynomial

Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2011-04-27 05:26:37
4Graph theory / Graph operations / NP-complete problems / Bipartite graphs / Combinatorial optimization / Matching / Line graph / Chordal graph / Clique / Complete bipartite graph / Independent set / Cograph

New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2013-03-14 00:55:15
5Graph theory / NP-complete problems / Graph operations / Graph coloring / Interval graph / Hamiltonian path / Bipartite graph / Ear decomposition / Indifference graph / Chordal graph / Cograph / Strongly chordal graph

An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2008-11-30 14:19:38
6Graph theory / Graph coloring / NP-complete problems / Combinatorial optimization / Matching / Treewidth / Graph / Bipartite graph / Planar graph / Ear decomposition / Degree / Line graph

Petr Kolman Bernard Lidick´ y Jean-S´ebastien Sereni ON FAIR EDGE DELETION PROBLEMS ´ AND J.-S. SERENI P. KOLMAN, B. LIDICKY,

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2009-09-29 04:25:56
7Graph theory / Mathematics / NP-complete problems / Matroid theory / Steiner tree problem / Bipartite graph / Eulerian path / Graph / Degree / Ear decomposition / Directed graph / Cycle

CS261: Exercise Set #7 For the week of February 15–19, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-02-18 01:28:39
8Graph theory / Mathematics / Computational complexity theory / Combinatorial optimization / Routing algorithms / Search algorithms / Matching / Randomized algorithm / A* search algorithm / Bipartite graph / HopcroftKarp algorithm / Threaded binary tree

On-line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology Mordechai Shalom1 ? , Prudence W.H. Wong ??2

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2009-06-10 05:42:48
9Graph theory / Mathematics / NP-complete problems / Bipartite graph / Parity / Matching / Perfect graph / Vertex cover

Max-Min Relations in Combinatorial Optimization Jos´e Soto October 6, 2010 Max-Min Relations in Combinatorial Optimization

Add to Reading List

Source URL: www.dim.uchile.cl

Language: English - Date: 2013-08-08 17:44:22
10Graph coloring / NP-complete problems / Bipartite graph / Parity / Graph theory / Treewidth / Vertex cover / Cubic graph / Cograph / Hadwiger number

Finding Approximate and Constrained Motifs in Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Dipartimento di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2013-01-07 10:28:15
UPDATE