Search

Your search keyword '"Busch, Arthur H."' showing total 17 results
Start Over Author "Busch, Arthur H."
17 results on '"Busch, Arthur H."'

1. New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs

Author

Busch, Arthur H., Dragan, Feodor F., Sritharan, R., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Wu, Weili, editor, and Daescu, Ovidiu, editor

Published
2010
Full Text
View/download PDF

2. Recognizing Bipartite Tolerance Graphs in Linear Time

Author

Busch, Arthur H., Isaak, Garth, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Brandstädt, Andreas, editor, Kratsch, Dieter, editor, and Müller, Haiko, editor

Published
2007
Full Text
View/download PDF

8. Packing of graphic n‐tuples

Author

Busch, Arthur H., primary, Ferrara, Michael J., additional, Hartke, Stephen G., additional, Jacobson, Michael S., additional, Kaul, Hemanshu, additional, and West, Douglas B., additional

Published
2011
Full Text
View/download PDF

15. Recognizing Bipartite Tolerance Graphs in Linear Time.

Author

Hutchison, David, Kanade, Takeo, Kittler, Josef, Kleinberg, Jon M., Mattern, Friedemann, Mitchell, John C., Naor, Moni, Nierstrasz, Oscar, Pandu Rangan, C., Steffen, Bernhard, Sudan, Madhu, Terzopoulos, Demetri, Tygar, Doug, Vardi, Moshe Y., Weikum, Gerhard, Brandstädt, Andreas, Kratsch, Dieter, Müller, Haiko, Busch, Arthur H., and Isaak, Garth

Abstract

A graph G = (V,E) is a tolerance graph if each vertex v ∈ V can be associated with an interval of the real line Iv and a positive real number tv in such a way that (uv) ∈ E if and only if Iv ∩ Iu ≥ min (tv,tu). No algorithm for recognizing tolerance graphs in general is known. In this paper we present an O(n + m) algorithm for recognizing tolerance graphs that are also bipartite, where n and m are the number vertices and edges of the graph, respectively. We also give a new structural characterization of these graphs based on the algorithm. [ABSTRACT FROM AUTHOR]

Published
2007
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results